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

Theorem cardprc 9906
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 10485 to ensure that there is always a cardinal larger than a given cardinal, but we can use Hartogs' construction hartogs 9463 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 6844 . . . . 5 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
2 id 22 . . . . 5 (𝑥 = 𝑦𝑥 = 𝑦)
31, 2eqeq12d 2753 . . . 4 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
43cbvabv 2807 . . 3 {𝑥 ∣ (card‘𝑥) = 𝑥} = {𝑦 ∣ (card‘𝑦) = 𝑦}
54cardprclem 9905 . 2 ¬ {𝑥 ∣ (card‘𝑥) = 𝑥} ∈ V
65nelir 3040 1 {𝑥 ∣ (card‘𝑥) = 𝑥} ∉ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  {cab 2715  wnel 3037  Vcvv 3442  cfv 6502  cardccrd 9861
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 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-se 5588  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-isom 6511  df-riota 7327  df-ov 7373  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-er 8647  df-en 8898  df-dom 8899  df-sdom 8900  df-oi 9429  df-har 9476  df-card 9865
This theorem is referenced by:  alephprc  10023
  Copyright terms: Public domain W3C validator