Theorem trunorfal 1620

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 1559	. . 3 ⊢ ((⊤ ⊽ ⊥) ↔ ¬ (⊤ ∨ ⊥))
2		truorfal 1608	. . 3 ⊢ ((⊤ ∨ ⊥) ↔ ⊤)
3	1, 2	xchbinx 337	. 2 ⊢ ((⊤ ⊽ ⊥) ↔ ¬ ⊤)
4		df-fal 1583	. 2 ⊢ (⊥ ↔ ¬ ⊤)
5	3, 4	bitr4i 281	1 ⊢ ((⊤ ⊽ ⊥) ↔ ⊥)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∨ wo 861   ⊽ wnor 1558  ⊤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-or 862  df-nor 1559  df-tru 1573  df-fal 1583

This theorem is used by:  falnortru  1621