| 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 1531 | . 2 ⊢ ((𝜑 ⊻ 𝜓) ↔ ¬ (𝜑 ↔ 𝜓)) | |
| 2 | nbi2 1028 | . 2 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))) | |
| 3 | 1, 2 | bitri 277 | 1 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∧ wa 399 ∨ wo 858 ⊻ wxo 1530 |
| 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 400 df-or 859 df-xor 1531 |
| This theorem is referenced by: xoror 1537 xornan 1538 cador 1627 saddisjlem 16481 xoromon 35348 wl-df4-3mintru2 37945 ifpdfxor 44027 dfxor4 44306 nanorxor 44845 |
| Copyright terms: Public domain | W3C validator |