Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xor | Structured version Visualization version GIF version |
Description: Two ways to express exclusive disjunction (df-xor 1502). Theorem *5.22 of [WhiteheadRussell] p. 124. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 22-Jan-2013.) |
Ref | Expression |
---|---|
xor | ⊢ (¬ (𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iman 404 | . . . 4 ⊢ ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓)) | |
2 | iman 404 | . . . 4 ⊢ ((𝜓 → 𝜑) ↔ ¬ (𝜓 ∧ ¬ 𝜑)) | |
3 | 1, 2 | anbi12i 628 | . . 3 ⊢ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) ↔ (¬ (𝜑 ∧ ¬ 𝜓) ∧ ¬ (𝜓 ∧ ¬ 𝜑))) |
4 | dfbi2 477 | . . 3 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))) | |
5 | ioran 980 | . . 3 ⊢ (¬ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)) ↔ (¬ (𝜑 ∧ ¬ 𝜓) ∧ ¬ (𝜓 ∧ ¬ 𝜑))) | |
6 | 3, 4, 5 | 3bitr4ri 306 | . 2 ⊢ (¬ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)) ↔ (𝜑 ↔ 𝜓)) |
7 | 6 | con1bii 359 | 1 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 |
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 209 df-an 399 df-or 844 |
This theorem is referenced by: pm5.24 1045 excxor 1507 elsymdif 4224 rpnnen2lem12 15578 ist0-3 21953 eliuniincex 41395 eliincex 41396 abnotataxb 43172 ldepslinc 44584 |
Copyright terms: Public domain | W3C validator |