| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xor2 | Structured version Visualization version GIF version | ||
| Description: Two ways to express "exclusive or". (Contributed by Mario Carneiro, 4-Sep-2016.) |
| Ref | Expression |
|---|---|
| xor2 | ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-xor 1542 | . 2 ⊢ ((𝜑 ⊻ 𝜓) ↔ ¬ (𝜑 ↔ 𝜓)) | |
| 2 | nbi2 1033 | . 2 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))) | |
| 3 | 1, 2 | bitri 278 | 1 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 ∨ wo 861 ⊻ wxo 1541 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-xor 1542 |
| This theorem is used by: xoror 1548 xornan 1549 cador 1641 saddisjlem 16547 xoromon 35504 wl-df4-3mintru2 38174 ifpdfxor 44254 dfxor4 44533 nanorxor 45056 |
| Copyright terms: Public domain | W3C validator |