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

Theorem eq0f 4294
Description: A class is equal to the empty set if and only if it has no elements. Theorem 2 of [Suppes] p. 22. (Contributed by BJ, 15-Jul-2021.)
Hypothesis
Ref Expression
eq0f.1 𝑥𝐴
Assertion
Ref Expression
eq0f (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥𝐴)

Proof of Theorem eq0f
StepHypRef Expression
1 eq0f.1 . . 3 𝑥𝐴
2 nfcv 2922 . . 3 𝑥
31, 2cleqf 2950 . 2 (𝐴 = ∅ ↔ ∀𝑥(𝑥𝐴𝑥 ∈ ∅))
4 noel 4284 . . . 4 ¬ 𝑥 ∈ ∅
54nbn 375 . . 3 𝑥𝐴 ↔ (𝑥𝐴𝑥 ∈ ∅))
65albii 1852 . 2 (∀𝑥 ¬ 𝑥𝐴 ↔ ∀𝑥(𝑥𝐴𝑥 ∈ ∅))
73, 6bitr4i 281 1 (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209  wal 1568   = wceq 1570  wcel 2145  wnfc 2907  c0 4279
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 2147  ax-9 2155  ax-11 2194  ax-12 2213  ax-ext 2732
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 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-dif 3902  df-nul 4280
This theorem is used by:  neq0f  4295  ab0ALT  4330  bnj1476  35357  stoweidlem34  46863
  Copyright terms: Public domain W3C validator