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 2961 . 2 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
2 eq0f.1 . . 3 𝑥𝐴
32neq0f 4302 . 2 𝐴 = ∅ ↔ ∃𝑥 𝑥𝐴)
41, 3bitri 278 1 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209   = wceq 1570  wex 1812  wcel 2146  wnfc 2912  wne 2960  c0 4286
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-12 2216  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-dif 3909  df-nul 4287
This theorem is used by:  inn0f  4326  cp  9890  ordtconnlem1  34378  iinss2d  45933  r19.3rzf  45934
  Copyright terms: Public domain W3C validator