| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > notfal | Structured version Visualization version GIF version | ||
| Description: A ¬ identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.) |
| Ref | Expression |
|---|---|
| notfal | ⊢ (¬ ⊥ ↔ ⊤) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fal 1584 | . 2 ⊢ ¬ ⊥ | |
| 2 | 1 | bitru 1579 | 1 ⊢ (¬ ⊥ ↔ ⊤) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ⊤wtru 1571 ⊥wfal 1582 |
| 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 1573 df-fal 1583 |
| This theorem is used by: trunanfal 1612 falnanfal 1614 truxorfal 1616 falnorfal 1622 wl-1xor 38223 ifpdfnan 44313 |
| Copyright terms: Public domain | W3C validator |