Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > trubifal | Structured version Visualization version GIF version |
Description: A ↔ identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.) (Proof shortened by Wolf Lammen, 10-Jul-2020.) |
Ref | Expression |
---|---|
trubifal | ⊢ ((⊤ ↔ ⊥) ↔ ⊥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bicom 221 | . 2 ⊢ ((⊤ ↔ ⊥) ↔ (⊥ ↔ ⊤)) | |
2 | falbitru 1569 | . 2 ⊢ ((⊥ ↔ ⊤) ↔ ⊥) | |
3 | 1, 2 | bitri 274 | 1 ⊢ ((⊤ ↔ ⊥) ↔ ⊥) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ⊤wtru 1540 ⊥wfal 1551 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 206 df-tru 1542 |
This theorem is referenced by: truxorfal 1585 |
Copyright terms: Public domain | W3C validator |