| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > inegd | Unicode version | ||
| Description: Negation introduction rule from natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.) |
| Ref | Expression |
|---|---|
| inegd.1 |
|
| Ref | Expression |
|---|---|
| inegd |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inegd.1 |
. . 3
| |
| 2 | 1 | ex 115 |
. 2
|
| 3 | dfnot 1420 |
. 2
| |
| 4 | 2, 3 | sylibr 134 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-fal 1408 |
| This theorem is used by: genpdisj 7890 cauappcvgprlemdisj 8018 caucvgprlemdisj 8041 caucvgprprlemdisj 8069 suplocexprlemdisj 8087 suplocexprlemub 8090 suplocsrlem 8175 resqrexlemgt0 11786 resqrexlemoverl 11787 leabs 11840 climge0 12091 isprm5lem 12919 ennnfonelemex 13305 dedekindeu 15724 dedekindicclemicc 15733 usgr1vr 16489 pw1nct 17033 |
| Copyright terms: Public domain | W3C validator |