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

Theorem cardprc 9899
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 10478 to ensure that there is always a cardinal larger than a given cardinal, but we can use Hartogs' construction hartogs 9454 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 6836 . . . . 5 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
2 id 22 . . . . 5 (𝑥 = 𝑦𝑥 = 𝑦)
31, 2eqeq12d 2753 . . . 4 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
43cbvabv 2807 . . 3 {𝑥 ∣ (card‘𝑥) = 𝑥} = {𝑦 ∣ (card‘𝑦) = 𝑦}
54cardprclem 9898 . 2 ¬ {𝑥 ∣ (card‘𝑥) = 𝑥} ∈ V
65nelir 3040 1 {𝑥 ∣ (card‘𝑥) = 𝑥} ∉ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  {cab 2715  wnel 3037  Vcvv 3430  cfv 6494  cardccrd 9854
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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-se 5580  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-isom 6503  df-riota 7319  df-ov 7365  df-2nd 7938  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-er 8638  df-en 8889  df-dom 8890  df-sdom 8891  df-oi 9420  df-har 9467  df-card 9858
This theorem is referenced by:  alephprc  10016
  Copyright terms: Public domain W3C validator