Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Predicate calculus with equality: Tarski's system S2 (1 rule, 6 schemes)
Axiom scheme ax-4 (Quantified Implication)
The empty domain of discourse
empty
Next ⟩
emptyex
Metamath Proof Explorer
Ascii
Unicode
Theorem
empty
Description:
Two characterizations of the empty domain.
(Contributed by
Gérard Lang
, 5-Feb-2024)
Ref
Expression
Assertion
empty
⊢
¬
∃
x
⊤
↔
∀
x
⊥
Proof
Step
Hyp
Ref
Expression
1
df-fal
⊢
⊥
↔
¬
⊤
2
1
albii
⊢
∀
x
⊥
↔
∀
x
¬
⊤
3
alnex
⊢
∀
x
¬
⊤
↔
¬
∃
x
⊤
4
2
3
bitr2i
⊢
¬
∃
x
⊤
↔
∀
x
⊥