Theorem eq0f 4296

Description: A class is equal to the empty set if and only if it has no elements. Theorem 2 of [Suppes] p. 22. (Contributed by BJ, 15-Jul-2021.)

Hypothesis

Ref	Expression
eq0f.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
eq0f	⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴)

Proof of Theorem eq0f

Step	Hyp	Ref	Expression
1		eq0f.1	. . 3 ⊢ Ⅎ𝑥𝐴
2		nfcv 2925	. . 3 ⊢ Ⅎ𝑥∅
3	1, 2	cleqf 2953	. 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅))
4		noel 4285	. . . 4 ⊢ ¬ 𝑥 ∈ ∅
5	4	nbn 375	. . 3 ⊢ (¬ 𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅))
6	5	albii 1851	. 2 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅))
7	3, 6	bitr4i 281	1 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1567   = wceq 1569   ∈ wcel 2146  Ⅎwnfc 2910  ∅c0 4280

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-11 2196  ax-12 2215  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-dif 4049  df-nul 4281

This theorem is used by:  neq0f  4297  ab0ALT  4332  bnj1476  35530  stoweidlem34  47183