| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xoror | Structured version Visualization version GIF version | ||
| Description: Exclusive disjunction implies disjunction ("XOR implies OR"). (Contributed by BJ, 19-Apr-2019.) |
| Ref | Expression |
|---|---|
| xoror | ⊢ ((𝜑 ⊻ 𝜓) → (𝜑 ∨ 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xor2 1547 | . 2 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))) | |
| 2 | 1 | simplbi 502 | 1 ⊢ ((𝜑 ⊻ 𝜓) → (𝜑 ∨ 𝜓)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ 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: mtpxor 1804 oneptri 44017 afv2orxorb 47998 |
| Copyright terms: Public domain | W3C validator |