Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > inegd | GIF 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 114 | . 2 ⊢ (𝜑 → (𝜓 → ⊥)) |
3 | dfnot 1334 | . 2 ⊢ (¬ 𝜓 ↔ (𝜓 → ⊥)) | |
4 | 2, 3 | sylibr 133 | 1 ⊢ (𝜑 → ¬ 𝜓) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ⊥wfal 1321 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-fal 1322 |
This theorem is referenced by: genpdisj 7299 cauappcvgprlemdisj 7427 caucvgprlemdisj 7450 caucvgprprlemdisj 7478 suplocexprlemdisj 7496 suplocexprlemub 7499 suplocsrlem 7584 resqrexlemgt0 10760 resqrexlemoverl 10761 leabs 10814 climge0 11062 ennnfonelemex 11854 dedekindeu 12697 dedekindicclemicc 12706 |
Copyright terms: Public domain | W3C validator |