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

Theorem cardprc 10018
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 10599 to ensure that there is always a cardinal larger than a given cardinal, but we can use Hartogs' construction hartogs 9582 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 6907 . . . . 5 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
2 id 22 . . . . 5 (𝑥 = 𝑦𝑥 = 𝑦)
31, 2eqeq12d 2751 . . . 4 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
43cbvabv 2810 . . 3 {𝑥 ∣ (card‘𝑥) = 𝑥} = {𝑦 ∣ (card‘𝑦) = 𝑦}
54cardprclem 10017 . 2 ¬ {𝑥 ∣ (card‘𝑥) = 𝑥} ∈ V
65nelir 3047 1 {𝑥 ∣ (card‘𝑥) = 𝑥} ∉ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1537  {cab 2712  wnel 3044  Vcvv 3478  cfv 6563  cardccrd 9973
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-isom 6572  df-riota 7388  df-ov 7434  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-oi 9548  df-har 9595  df-card 9977
This theorem is referenced by:  alephprc  10137
  Copyright terms: Public domain W3C validator