MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  neq0f Structured version   Visualization version   GIF version

Theorem neq0f 4275
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 4279 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
StepHypRef Expression
1 eq0f.1 . . . 4 𝑥𝐴
21eq0f 4274 . . 3 (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥𝐴)
32notbii 320 . 2 𝐴 = ∅ ↔ ¬ ∀𝑥 ¬ 𝑥𝐴)
4 df-ex 1783 . 2 (∃𝑥 𝑥𝐴 ↔ ¬ ∀𝑥 ¬ 𝑥𝐴)
53, 4bitr4i 277 1 𝐴 = ∅ ↔ ∃𝑥 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wal 1537   = wceq 1539  wex 1782  wcel 2106  wnfc 2887  c0 4256
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-11 2154  ax-12 2171  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-dif 3890  df-nul 4257
This theorem is referenced by:  n0f  4276  neq0OLD  4282
  Copyright terms: Public domain W3C validator