Theorem harcard 9992

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 9573	. 2 ⊢ (har‘𝐴) ∈ On
2		harndom 9576	. . . . . . 7 ⊢ ¬ (har‘𝐴) ≼ 𝐴
3		simpll 766	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑥 ∈ On)
4		simpr 484	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ (har‘𝐴))
5		elharval 9575	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (har‘𝐴) ↔ (𝑦 ∈ On ∧ 𝑦 ≼ 𝐴))
6	4, 5	sylib 218	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑦 ∈ On ∧ 𝑦 ≼ 𝐴))
7	6	simpld 494	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ∈ On)
8		ontri1 6386	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
9	3, 7, 8	syl2anc 584	. . . . . . . 8 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑥))
10		simpllr 775	. . . . . . . . . 10 ⊢ ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → (har‘𝐴) ≈ 𝑥)
11		ssdomg 9014	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ V → (𝑥 ⊆ 𝑦 → 𝑥 ≼ 𝑦))
12	11	elv 3464	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝑦 → 𝑥 ≼ 𝑦)
13	6	simprd 495	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → 𝑦 ≼ 𝐴)
14		domtr 9021	. . . . . . . . . . 11 ⊢ ((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝐴) → 𝑥 ≼ 𝐴)
15	12, 13, 14	syl2anr 597	. . . . . . . . . 10 ⊢ ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → 𝑥 ≼ 𝐴)
16		endomtr 9026	. . . . . . . . . 10 ⊢ (((har‘𝐴) ≈ 𝑥 ∧ 𝑥 ≼ 𝐴) → (har‘𝐴) ≼ 𝐴)
17	10, 15, 16	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) ∧ 𝑥 ⊆ 𝑦) → (har‘𝐴) ≼ 𝐴)
18	17	ex 412	. . . . . . . 8 ⊢ (((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) ∧ 𝑦 ∈ (har‘𝐴)) → (𝑥 ⊆ 𝑦 → (har‘𝐴) ≼ 𝐴))
19	9, 18	sylbird 260	. . . . . . 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 3964	. . . 4 ⊢ ((𝑥 ∈ On ∧ (har‘𝐴) ≈ 𝑥) → (har‘𝐴) ⊆ 𝑥)
23	22	ex 412	. . 3 ⊢ (𝑥 ∈ On → ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥))
24	23	rgen 3053	. 2 ⊢ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)
25		iscard2 9990	. 2 ⊢ ((card‘(har‘𝐴)) = (har‘𝐴) ↔ ((har‘𝐴) ∈ On ∧ ∀𝑥 ∈ On ((har‘𝐴) ≈ 𝑥 → (har‘𝐴) ⊆ 𝑥)))
26	1, 24, 25	mpbir2an 711	1 ⊢ (card‘(har‘𝐴)) = (har‘𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3051  Vcvv 3459   ⊆ wss 3926   class class class wbr 5119  Oncon0 6352  ‘cfv 6531   ≈ cen 8956   ≼ cdom 8957  harchar 9570  cardccrd 9949

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  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 7362  df-ov 7408  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-er 8719  df-en 8960  df-dom 8961  df-oi 9524  df-har 9571  df-card 9953

This theorem is referenced by:  cardprclem  9993  alephcard  10084  pwcfsdom  10597  hargch  10687