Theorem falbitru 1600

Description: A ↔ identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.) (Proof shortened by Wolf Lammen, 10-Jul-2020.)

Assertion

Ref	Expression
falbitru	⊢ ((⊥ ↔ ⊤) ↔ ⊥)

Proof of Theorem falbitru

Step	Hyp	Ref	Expression
1		tbtru 1578	. 2 ⊢ (⊥ ↔ (⊥ ↔ ⊤))
2	1	bicomi 227	1 ⊢ ((⊥ ↔ ⊤) ↔ ⊥)

This proof depends on syntax axioms:   ↔ wb 209  ⊤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-tru 1573

This theorem is used by:  trubifal  1601