Theorem trunorfal 1612

Description: A ⊽ identity. (Contributed by Remi, 25-Oct-2023.) (Proof shortened by Wolf Lammen, 17-Dec-2023.)

Assertion

Ref	Expression
trunorfal	⊢ ((⊤ ⊽ ⊥) ↔ ⊥)

Proof of Theorem trunorfal

Step	Hyp	Ref	Expression
1		df-nor 1551	. . 3 ⊢ ((⊤ ⊽ ⊥) ↔ ¬ (⊤ ∨ ⊥))
2		truorfal 1600	. . 3 ⊢ ((⊤ ∨ ⊥) ↔ ⊤)
3	1, 2	xchbinx 336	. 2 ⊢ ((⊤ ⊽ ⊥) ↔ ¬ ⊤)
4		df-fal 1575	. 2 ⊢ (⊥ ↔ ¬ ⊤)
5	3, 4	bitr4i 280	1 ⊢ ((⊤ ⊽ ⊥) ↔ ⊥)

Syntax hints:  ¬ wn 3   ↔ wb 208   ∨ wo 858   ⊽ wnor 1550  ⊤wtru 1563  ⊥wfal 1574

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 859  df-nor 1551  df-tru 1565  df-fal 1575

This theorem is referenced by:  falnortru  1613