| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nbfal | Structured version Visualization version GIF version | ||
| Description: The negation of a proposition is equivalent to itself being equivalent to ⊥. (Contributed by Anthony Hart, 14-Aug-2011.) |
| Ref | Expression |
|---|---|
| nbfal | ⊢ (¬ 𝜑 ↔ (𝜑 ↔ ⊥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fal 1583 | . 2 ⊢ ¬ ⊥ | |
| 2 | 1 | nbn 375 | 1 ⊢ (¬ 𝜑 ↔ (𝜑 ↔ ⊥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ⊥wfal 1581 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-tru 1572 df-fal 1582 |
| This theorem is used by: nulmo 2740 eq0 4299 ab0w 4330 ab0 4331 bisym1 37334 wl-1xor 38545 wl-1mintru1 38551 aisfina 48107 aifftbifffaibifff 48131 lindslinindsimp2 49714 |
| Copyright terms: Public domain | W3C validator |