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

Theorem harcard 9890
Description: The class of ordinal numbers dominated by a set is a cardinal number. Theorem 59 of [Suppes] p. 228. (Contributed by Mario Carneiro, 20-Jan-2013.) (Revised by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
harcard (card‘(har‘𝐴)) = (har‘𝐴)

Proof of Theorem harcard
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 harcl 9464 . 2 (har‘𝐴) ∈ On
2 harndom 9467 . . . . . . 7 ¬ (har‘𝐴) ≼ 𝐴
3 simpll 766 . . . . . . . . 9 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑥 ∈ On)
4 simpr 484 . . . . . . . . . . 11 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ (har‘𝐴))
5 elharval 9466 . . . . . . . . . . 11 (𝑦 ∈ (har‘𝐴) ↔ (𝑦 ∈ On ∧ 𝑦𝐴))
64, 5sylib 218 . . . . . . . . . 10 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑦 ∈ On ∧ 𝑦𝐴))
76simpld 494 . . . . . . . . 9 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ On)
8 ontri1 6351 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥𝑦 ↔ ¬ 𝑦𝑥))
93, 7, 8syl2anc 584 . . . . . . . 8 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥𝑦 ↔ ¬ 𝑦𝑥))
10 simpllr 775 . . . . . . . . . 10 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥𝑦) → (har‘𝐴) ≈ 𝑥)
11 ssdomg 8937 . . . . . . . . . . . 12 (𝑦 ∈ V → (𝑥𝑦𝑥𝑦))
1211elv 3445 . . . . . . . . . . 11 (𝑥𝑦𝑥𝑦)
136simprd 495 . . . . . . . . . . 11 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦𝐴)
14 domtr 8944 . . . . . . . . . . 11 ((𝑥𝑦𝑦𝐴) → 𝑥𝐴)
1512, 13, 14syl2anr 597 . . . . . . . . . 10 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥𝑦) → 𝑥𝐴)
16 endomtr 8949 . . . . . . . . . 10 (((har‘𝐴) ≈ 𝑥𝑥𝐴) → (har‘𝐴) ≼ 𝐴)
1710, 15, 16syl2anc 584 . . . . . . . . 9 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥𝑦) → (har‘𝐴) ≼ 𝐴)
1817ex 412 . . . . . . . 8 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥𝑦 → (har‘𝐴) ≼ 𝐴))
199, 18sylbird 260 . . . . . . 7 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (¬ 𝑦𝑥 → (har‘𝐴) ≼ 𝐴))
202, 19mt3i 149 . . . . . 6 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦𝑥)
2120ex 412 . . . . 5 ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (𝑦 ∈ (har‘𝐴) → 𝑦𝑥))
2221ssrdv 3939 . . . 4 ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (har‘𝐴) ⊆ 𝑥)
2322ex 412 . . 3 (𝑥 ∈ On → ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥))
2423rgen 3053 . 2 𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)
25 iscard2 9888 . 2 ((card‘(har‘𝐴)) = (har‘𝐴) ↔ ((har‘𝐴) ∈ On ∧ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)))
261, 24, 25mpbir2an 711 1 (card‘(har‘𝐴)) = (har‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3051  Vcvv 3440  wss 3901   class class class wbr 5098  Oncon0 6317  cfv 6492  cen 8880  cdom 8881  harchar 9461  cardccrd 9847
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7315  df-ov 7361  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-er 8635  df-en 8884  df-dom 8885  df-oi 9415  df-har 9462  df-card 9851
This theorem is referenced by:  cardprclem  9891  alephcard  9980  pwcfsdom  10494  hargch  10584
  Copyright terms: Public domain W3C validator