| 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 1483 |
. 2
|
| 4 | alnex 1513 |
. 2
| |
| 5 | 3, 4 | sylib 122 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-5 1461 ax-gen 1463 ax-ie2 1508 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-fal 1370 |
| This theorem is referenced by: nexdv 1955 |
| Copyright terms: Public domain | W3C validator |