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

Theorem n0f 4372
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 4376 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 2947 . 2 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
2 eq0f.1 . . 3 𝑥𝐴
32neq0f 4371 . 2 𝐴 = ∅ ↔ ∃𝑥 𝑥𝐴)
41, 3bitri 275 1 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206   = wceq 1537  wex 1777  wcel 2108  wnfc 2893  wne 2946  c0 4352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2158  ax-12 2178  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-dif 3979  df-nul 4353
This theorem is referenced by:  inn0f  4394  cp  9960  ordtconnlem1  33870  iinss2d  45062  r19.3rzf  45063
  Copyright terms: Public domain W3C validator