Theorem harcard 9667

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.

Step	Hyp	Ref	Expression
1		harcl 9248	. 2 ⊢ (har‘𝐴) ∈ On
2		harndom 9251	. . . . . . 7 ⊢ ¬ (har‘𝐴) ≼ 𝐴
3		simpll 763	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑥 ∈ On)
4		simpr 484	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ (har‘𝐴))
5		elharval 9250	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (har‘𝐴) ↔ (𝑦 ∈ On ∧ 𝑦 ≼ 𝐴))
6	4, 5	sylib 217	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑦 ∈ On ∧ 𝑦 ≼ 𝐴))
7	6	simpld 494	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ On)
8		ontri1 6285	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
9	3, 7, 8	syl2anc 583	. . . . . . . 8 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
10		simpllr 772	. . . . . . . . . 10 ⊢ ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → (har‘𝐴) ≈ 𝑥)
11		ssdomg 8741	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ V → (𝑥 ⊆ 𝑦 → 𝑥 ≼ 𝑦))
12	11	elv 3428	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝑦 → 𝑥 ≼ 𝑦)
13	6	simprd 495	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ≼ 𝐴)
14		domtr 8748	. . . . . . . . . . 11 ⊢ ((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝐴) → 𝑥 ≼ 𝐴)
15	12, 13, 14	syl2anr 596	. . . . . . . . . 10 ⊢ ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → 𝑥 ≼ 𝐴)
16		endomtr 8753	. . . . . . . . . 10 ⊢ (((har‘𝐴) ≈ 𝑥 ∧ 𝑥 ≼ 𝐴) → (har‘𝐴) ≼ 𝐴)
17	10, 15, 16	syl2anc 583	. . . . . . . . 9 ⊢ ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → (har‘𝐴) ≼ 𝐴)
18	17	ex 412	. . . . . . . 8 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥 ⊆ 𝑦 → (har‘𝐴) ≼ 𝐴))
19	9, 18	sylbird 259	. . . . . . 7 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (¬ 𝑦 ∈ 𝑥 → (har‘𝐴) ≼ 𝐴))
20	2, 19	mt3i 149	. . . . . 6 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ 𝑥)
21	20	ex 412	. . . . 5 ⊢ ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (𝑦 ∈ (har‘𝐴) → 𝑦 ∈ 𝑥))
22	21	ssrdv 3923	. . . 4 ⊢ ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (har‘𝐴) ⊆ 𝑥)
23	22	ex 412	. . 3 ⊢ (𝑥 ∈ On → ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥))
24	23	rgen 3073	. 2 ⊢ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)
25		iscard2 9665	. 2 ⊢ ((card‘(har‘𝐴)) = (har‘𝐴) ↔ ((har‘𝐴) ∈ On ∧ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)))
26	1, 24, 25	mpbir2an 707	1 ⊢ (card‘(har‘𝐴)) = (har‘𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3063  Vcvv 3422   ⊆ wss 3883   class class class wbr 5070  Oncon0 6251  ‘cfv 6418   ≈ cen 8688   ≼ cdom 8689  harchar 9245  cardccrd 9624

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-er 8456  df-en 8692  df-dom 8693  df-oi 9199  df-har 9246  df-card 9628

This theorem is referenced by:  cardprclem  9668  alephcard  9757  pwcfsdom  10270  hargch  10360