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

Theorem excxor 1638
Description: This tautology shows that xor is really exclusive. (Contributed by FL, 22-Nov-2010.)
Assertion
Ref Expression
excxor ((𝜑𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑𝜓)))

Proof of Theorem excxor
StepHypRef Expression
1 df-xor 1634 . 2 ((𝜑𝜓) ↔ ¬ (𝜑𝜓))
2 xor 1038 . 2 (¬ (𝜑𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)))
3 ancom 452 . . 3 ((𝜓 ∧ ¬ 𝜑) ↔ (¬ 𝜑𝜓))
43orbi2i 936 . 2 (((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑𝜓)))
51, 2, 43bitri 288 1 ((𝜑𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (¬ 𝜑𝜓)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 197  wa 384  wo 873  wxo 1633
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-an 385  df-or 874  df-xor 1634
This theorem is referenced by:  f1omvdco2  18145  psgnunilem5  18191  psgnunilem5OLD  18192  or3or  39017
  Copyright terms: Public domain W3C validator