Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nexd | Unicode version |
Description: Deduction for generalization rule for negated wff. (Contributed by NM, 2-Jan-2002.) |
Ref | Expression |
---|---|
nexd.1 | |
nexd.2 |
Ref | Expression |
---|---|
nexd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nexd.1 | . . 3 | |
2 | nexd.2 | . . 3 | |
3 | 1, 2 | alrimih 1358 | . 2 |
4 | alnex 1388 | . 2 | |
5 | 3, 4 | sylib 127 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wal 1241 wex 1381 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-5 1336 ax-gen 1338 ax-ie2 1383 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-fal 1249 |
This theorem is referenced by: nexdv 1811 |
Copyright terms: Public domain | W3C validator |