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

Theorem falxorfal 1531
Description: A identity. (Contributed by David A. Wheeler, 9-May-2015.)
Assertion
Ref Expression
falxorfal ((⊥ ⊻ ⊥) ↔ ⊥)

Proof of Theorem falxorfal
StepHypRef Expression
1 df-xor 1465 . . 3 ((⊥ ⊻ ⊥) ↔ ¬ (⊥ ↔ ⊥))
2 falbifal 1523 . . 3 ((⊥ ↔ ⊥) ↔ ⊤)
31, 2xchbinx 324 . 2 ((⊥ ⊻ ⊥) ↔ ¬ ⊤)
4 nottru 1518 . 2 (¬ ⊤ ↔ ⊥)
53, 4bitri 264 1 ((⊥ ⊻ ⊥) ↔ ⊥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 196  wxo 1464  wtru 1484  wfal 1488
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 197  df-xor 1465  df-tru 1486  df-fal 1489
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator