Theorem empty 1935

Description: Two characterizations of the empty domain. (Contributed by Gérard Lang, 5-Feb-2024.)

Assertion

Ref	Expression
empty	⊢ (¬ ∃𝑥⊤ ↔ ∀𝑥⊥)

Proof of Theorem empty

Step	Hyp	Ref	Expression
1		df-fal 1582	. . 3 ⊢ (⊥ ↔ ¬ ⊤)
2	1	albii 1848	. 2 ⊢ (∀𝑥⊥ ↔ ∀𝑥 ¬ ⊤)
3		alnex 1810	. 2 ⊢ (∀𝑥 ¬ ⊤ ↔ ¬ ∃𝑥⊤)
4	2, 3	bitr2i 279	1 ⊢ (¬ ∃𝑥⊤ ↔ ∀𝑥⊥)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1567  ⊤wtru 1570  ⊥wfal 1581  ∃wex 1808

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838

This proof depends on definitions:  df-bi 210  df-fal 1582  df-ex 1809

This theorem is used by:  bj-cbveaw  37293