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

Theorem harcard 10047
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 9628 . 2 (har‘𝐴) ∈ On
2 harndom 9631 . . . . . . 7 ¬ (har‘𝐴) ≼ 𝐴
3 simpll 766 . . . . . . . . 9 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑥 ∈ On)
4 simpr 484 . . . . . . . . . . 11 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ (har‘𝐴))
5 elharval 9630 . . . . . . . . . . 11 (𝑦 ∈ (har‘𝐴) ↔ (𝑦 ∈ On ∧ 𝑦𝐴))
64, 5sylib 218 . . . . . . . . . 10 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑦 ∈ On ∧ 𝑦𝐴))
76simpld 494 . . . . . . . . 9 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ On)
8 ontri1 6429 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥𝑦 ↔ ¬ 𝑦𝑥))
93, 7, 8syl2anc 583 . . . . . . . 8 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥𝑦 ↔ ¬ 𝑦𝑥))
10 simpllr 775 . . . . . . . . . 10 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥𝑦) → (har‘𝐴) ≈ 𝑥)
11 ssdomg 9060 . . . . . . . . . . . 12 (𝑦 ∈ V → (𝑥𝑦𝑥𝑦))
1211elv 3493 . . . . . . . . . . 11 (𝑥𝑦𝑥𝑦)
136simprd 495 . . . . . . . . . . 11 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦𝐴)
14 domtr 9067 . . . . . . . . . . 11 ((𝑥𝑦𝑦𝐴) → 𝑥𝐴)
1512, 13, 14syl2anr 596 . . . . . . . . . 10 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥𝑦) → 𝑥𝐴)
16 endomtr 9072 . . . . . . . . . 10 (((har‘𝐴) ≈ 𝑥𝑥𝐴) → (har‘𝐴) ≼ 𝐴)
1710, 15, 16syl2anc 583 . . . . . . . . 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 4014 . . . 4 ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (har‘𝐴) ⊆ 𝑥)
2322ex 412 . . 3 (𝑥 ∈ On → ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥))
2423rgen 3069 . 2 𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)
25 iscard2 10045 . 2 ((card‘(har‘𝐴)) = (har‘𝐴) ↔ ((har‘𝐴) ∈ On ∧ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)))
261, 24, 25mpbir2an 710 1 (card‘(har‘𝐴)) = (har‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067  Vcvv 3488  wss 3976   class class class wbr 5166  Oncon0 6395  cfv 6573  cen 9000  cdom 9001  harchar 9625  cardccrd 10004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-se 5653  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-isom 6582  df-riota 7404  df-ov 7451  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-er 8763  df-en 9004  df-dom 9005  df-oi 9579  df-har 9626  df-card 10008
This theorem is referenced by:  cardprclem  10048  alephcard  10139  pwcfsdom  10652  hargch  10742
  Copyright terms: Public domain W3C validator