| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > truxortru | Structured version Visualization version GIF version | ||
| Description: A ⊻ identity. (Contributed by David A. Wheeler, 8-May-2015.) |
| Ref | Expression |
|---|---|
| truxortru | ⊢ ((⊤ ⊻ ⊤) ↔ ⊥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-xor 1542 | . . 3 ⊢ ((⊤ ⊻ ⊤) ↔ ¬ (⊤ ↔ ⊤)) | |
| 2 | trubitru 1599 | . . 3 ⊢ ((⊤ ↔ ⊤) ↔ ⊤) | |
| 3 | 1, 2 | xchbinx 337 | . 2 ⊢ ((⊤ ⊻ ⊤) ↔ ¬ ⊤) |
| 4 | nottru 1597 | . 2 ⊢ (¬ ⊤ ↔ ⊥) | |
| 5 | 3, 4 | bitri 278 | 1 ⊢ ((⊤ ⊻ ⊤) ↔ ⊥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ⊻ wxo 1541 ⊤wtru 1571 ⊥wfal 1582 |
| 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-xor 1542 df-tru 1573 df-fal 1583 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |