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

Theorem neq0f 4283
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 4287 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 4282 . . 3 (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥𝐴)
32notbii 321 . 2 𝐴 = ∅ ↔ ¬ ∀𝑥 ¬ 𝑥𝐴)
4 df-ex 1787 . 2 (∃𝑥 𝑥𝐴 ↔ ¬ ∀𝑥 ¬ 𝑥𝐴)
53, 4bitr4i 279 1 𝐴 = ∅ ↔ ∃𝑥 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 207  wal 1545   = wceq 1547  wex 1786  wcel 2119  wnfc 2887  c0 4268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-11 2168  ax-12 2189  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-dif 3893  df-nul 4269
This theorem is referenced by:  n0f  4284  ralfal  45615
  Copyright terms: Public domain W3C validator