MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  truxorfal Structured version   Visualization version   GIF version

Theorem truxorfal 1699
Description: A identity. (Contributed by David A. Wheeler, 8-May-2015.)
Assertion
Ref Expression
truxorfal ((⊤ ⊻ ⊥) ↔ ⊤)

Proof of Theorem truxorfal
StepHypRef Expression
1 df-xor 1634 . . 3 ((⊤ ⊻ ⊥) ↔ ¬ (⊤ ↔ ⊥))
2 trubifal 1684 . . 3 ((⊤ ↔ ⊥) ↔ ⊥)
31, 2xchbinx 325 . 2 ((⊤ ⊻ ⊥) ↔ ¬ ⊥)
4 notfal 1681 . 2 (¬ ⊥ ↔ ⊤)
53, 4bitri 266 1 ((⊤ ⊻ ⊥) ↔ ⊤)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 197  wxo 1633  wtru 1653  wfal 1665
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 198  df-xor 1634  df-tru 1656  df-fal 1666
This theorem is referenced by:  falxortru  1700
  Copyright terms: Public domain W3C validator