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

Theorem n0f 4303
Description: A class is nonempty if and only if it has at least one element. Proposition 5.17(1) of [TakeutiZaring] p. 20. This version of n0 4307 requires only that 𝑥 not be free in, rather than not occur in, 𝐴. (Contributed by NM, 17-Oct-2003.)
Hypothesis
Ref Expression
eq0f.1 𝑥𝐴
Assertion
Ref Expression
n0f (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)

Proof of Theorem n0f
StepHypRef Expression
1 df-ne 2934 . 2 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
2 eq0f.1 . . 3 𝑥𝐴
32neq0f 4302 . 2 𝐴 = ∅ ↔ ∃𝑥 𝑥𝐴)
41, 3bitri 275 1 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206   = wceq 1542  wex 1781  wcel 2114  wnfc 2884  wne 2933  c0 4287
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-12 2185  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-dif 3906  df-nul 4288
This theorem is referenced by:  inn0f  4325  cp  9815  ordtconnlem1  34101  iinss2d  45513  r19.3rzf  45514
  Copyright terms: Public domain W3C validator