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

Theorem harcard 10040
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 9537 . 2 (har‘𝐴) ∈ On
2 harndom 9540 . . . . . . 7 ¬ (har‘𝐴) ≼ 𝐴
3 simpll 779 . . . . . . . . 9 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑥 ∈ On)
4 elharval 9539 . . . . . . . . . . 11 (𝑦 ∈ (har‘𝐴) ↔ (𝑦 ∈ On ∧ 𝑦 ≼ 𝐴))
54bilani 510 . . . . . . . . . 10 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑦 ∈ On ∧ 𝑦 ≼ 𝐴))
65simpld 500 . . . . . . . . 9 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ On)
7 ontri1 6390 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
83, 6, 7syl2anc 596 . . . . . . . 8 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
9 simpllr 788 . . . . . . . . . 10 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → (har‘𝐴) ≈ 𝑥)
10 ssdomg 9011 . . . . . . . . . . . 12 (𝑦 ∈ V → (𝑥 ⊆ 𝑦 → 𝑥 ≼ 𝑦))
1110elv 3456 . . . . . . . . . . 11 (𝑥 ⊆ 𝑦 → 𝑥 ≼ 𝑦)
125simprd 501 . . . . . . . . . . 11 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ≼ 𝐴)
13 domtr 9018 . . . . . . . . . . 11 ((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝐴) → 𝑥 ≼ 𝐴)
1411, 12, 13syl2anr 609 . . . . . . . . . 10 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → 𝑥 ≼ 𝐴)
15 endomtr 9023 . . . . . . . . . 10 (((har‘𝐴) ≈ 𝑥 ∧ 𝑥 ≼ 𝐴) → (har‘𝐴) ≼ 𝐴)
169, 14, 15syl2anc 596 . . . . . . . . 9 ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → (har‘𝐴) ≼ 𝐴)
1716ex 418 . . . . . . . 8 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥 ⊆ 𝑦 → (har‘𝐴) ≼ 𝐴))
188, 17sylbird 263 . . . . . . 7 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (¬ 𝑦 ∈ 𝑥 → (har‘𝐴) ≼ 𝐴))
192, 18mt3i 150 . . . . . 6 (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ 𝑥)
2019ex 418 . . . . 5 ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (𝑦 ∈ (har‘𝐴) → 𝑦 ∈ 𝑥))
2120ssrdv 3937 . . . 4 ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (har‘𝐴) ⊆ 𝑥)
2221ex 418 . . 3 (𝑥 ∈ On → ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥))
2322rgen 3079 . 2 ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)
24 iscard2 10038 . 2 ((card‘(har‘𝐴)) = (har‘𝐴) ↔ ((har‘𝐴) ∈ On ∧ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)))
251, 23, 24mpbir2an 724 1 (card‘(har‘𝐴)) = (har‘𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ⊆ wss 3899   class class class wbr 5103  Oncon0 6355  ‘cfv 6531   ≈ cen 8954   ≼ cdom 8955  harchar 9534  cardccrd 9997
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7369  df-ov 7415  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-er 8701  df-en 8958  df-dom 8959  df-oi 9488  df-har 9535  df-card 10001
This theorem is used by:  cardprclem  10041  alephcard  10130  pwcfsdom  10649  hargch  10739
  Copyright terms: Public domain W3C validator