| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trunorfal | Structured version Visualization version GIF version | ||
| Description: A ⊽ identity. (Contributed by Remi, 25-Oct-2023.) (Proof shortened by Wolf Lammen, 17-Dec-2023.) |
| Ref | Expression |
|---|---|
| trunorfal | ⊢ ((⊤ ⊽ ⊥) ↔ ⊥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nor 1537 | . . 3 ⊢ ((⊤ ⊽ ⊥) ↔ ¬ (⊤ ∨ ⊥)) | |
| 2 | truorfal 1586 | . . 3 ⊢ ((⊤ ∨ ⊥) ↔ ⊤) | |
| 3 | 1, 2 | xchbinx 336 | . 2 ⊢ ((⊤ ⊽ ⊥) ↔ ¬ ⊤) |
| 4 | df-fal 1561 | . 2 ⊢ (⊥ ↔ ¬ ⊤) | |
| 5 | 3, 4 | bitr4i 280 | 1 ⊢ ((⊤ ⊽ ⊥) ↔ ⊥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∨ wo 854 ⊽ wnor 1536 ⊤wtru 1549 ⊥wfal 1560 |
| 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-or 855 df-nor 1537 df-tru 1551 df-fal 1561 |
| This theorem is referenced by: falnortru 1599 |
| Copyright terms: Public domain | W3C validator |