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

Theorem cardprc 9393
Description: The class of all cardinal numbers is not a set (i.e. is a proper class). Theorem 19.8 of [Eisenberg] p. 310. In this proof (which does not use AC), we cannot use Cantor's construction canth3 9972 to ensure that there is always a cardinal larger than a given cardinal, but we can use Hartogs' construction hartogs 8992 to construct (effectively) (ℵ‘suc 𝐴) from (ℵ‘𝐴), which achieves the same thing. (Contributed by Mario Carneiro, 22-Jan-2013.)
Assertion
Ref Expression
cardprc {𝑥 ∣ (card‘𝑥) = 𝑥} ∉ V

Proof of Theorem cardprc
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6645 . . . . 5 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
2 id 22 . . . . 5 (𝑥 = 𝑦𝑥 = 𝑦)
31, 2eqeq12d 2814 . . . 4 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
43cbvabv 2866 . . 3 {𝑥 ∣ (card‘𝑥) = 𝑥} = {𝑦 ∣ (card‘𝑦) = 𝑦}
54cardprclem 9392 . 2 ¬ {𝑥 ∣ (card‘𝑥) = 𝑥} ∈ V
65nelir 3094 1 {𝑥 ∣ (card‘𝑥) = 𝑥} ∉ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1538  {cab 2776  wnel 3091  Vcvv 3441  cfv 6324  cardccrd 9348
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-wrecs 7930  df-recs 7991  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-oi 8958  df-har 9005  df-card 9352
This theorem is referenced by:  alephprc  9510
  Copyright terms: Public domain W3C validator