Theorem neq0f 4297

Description: A class is not empty if and only if it has at least one element. Proposition 5.17(1) of [TakeutiZaring] p. 20. This version of neq0 4301 requires only that 𝑥 not be free in, rather than not occur in, 𝐴. (Contributed by BJ, 15-Jul-2021.)

Hypothesis

Ref	Expression
eq0f.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
neq0f	⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)

Proof of Theorem neq0f

Step	Hyp	Ref	Expression
1		eq0f.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2	1	eq0f 4296	. . 3 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴)
3	2	notbii 320	. 2 ⊢ (¬ 𝐴 = ∅ ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴)
4		df-ex 1781	. 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴)
5	3, 4	bitr4i 278	1 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 206  ∀wal 1539   = wceq 1541  ∃wex 1780   ∈ wcel 2113  Ⅎwnfc 2880  ∅c0 4282

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-11 2162  ax-12 2182  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-dif 3901  df-nul 4283

This theorem is referenced by:  n0f  4298  ralfal  45321