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

Theorem falxortru 1700
Description: A identity. (Contributed by David A. Wheeler, 9-May-2015.) (Proof shortened by Wolf Lammen, 10-Jul-2020.)
Assertion
Ref Expression
falxortru ((⊥ ⊻ ⊤) ↔ ⊤)

Proof of Theorem falxortru
StepHypRef Expression
1 xorcom 1636 . 2 ((⊥ ⊻ ⊤) ↔ (⊤ ⊻ ⊥))
2 truxorfal 1699 . 2 ((⊤ ⊻ ⊥) ↔ ⊤)
31, 2bitri 266 1 ((⊥ ⊻ ⊤) ↔ ⊤)
Colors of variables: wff setvar class
Syntax hints:  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: (None)
  Copyright terms: Public domain W3C validator