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

Theorem xor 1039
Description: Two ways to express exclusive disjunction (df-xor 1635). Theorem *5.22 of [WhiteheadRussell] p. 124. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 22-Jan-2013.)
Assertion
Ref Expression
xor (¬ (𝜑𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)))

Proof of Theorem xor
StepHypRef Expression
1 iman 391 . . . 4 ((𝜑𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓))
2 iman 391 . . . 4 ((𝜓𝜑) ↔ ¬ (𝜓 ∧ ¬ 𝜑))
31, 2anbi12i 621 . . 3 (((𝜑𝜓) ∧ (𝜓𝜑)) ↔ (¬ (𝜑 ∧ ¬ 𝜓) ∧ ¬ (𝜓 ∧ ¬ 𝜑)))
4 dfbi2 467 . . 3 ((𝜑𝜓) ↔ ((𝜑𝜓) ∧ (𝜓𝜑)))
5 ioran 1007 . . 3 (¬ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)) ↔ (¬ (𝜑 ∧ ¬ 𝜓) ∧ ¬ (𝜓 ∧ ¬ 𝜑)))
63, 4, 53bitr4ri 296 . 2 (¬ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)) ↔ (𝜑𝜓))
76con1bii 348 1 (¬ (𝜑𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 385  wo 874
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 199  df-an 386  df-or 875
This theorem is referenced by:  pm5.24  1074  excxor  1639  elsymdif  4046  symdif2OLD  4054  rpnnen2lem12  15290  ist0-3  21478  eliuniincex  40050  eliincex  40051  abnotataxb  41829  ldepslinc  43097
  Copyright terms: Public domain W3C validator