Theorem cardcl 7349

Description: The cardinality of a well-orderable set is an ordinal. (Contributed by Jim Kingdon, 30-Aug-2021.)

Assertion

Ref	Expression
cardcl	⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (card‘𝐴) ∈ On)

Distinct variable group:   𝑦,𝐴

Proof of Theorem cardcl

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-card 7347	. . . 4 ⊢ card = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥})
2	1	a1i 9	. . 3 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → card = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥}))
3		breq2 4086	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑦 ≈ 𝑥 ↔ 𝑦 ≈ 𝐴))
4	3	rabbidv 2788	. . . . 5 ⊢ (𝑥 = 𝐴 → {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} = {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
5	4	inteqd 3927	. . . 4 ⊢ (𝑥 = 𝐴 → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
6	5	adantl 277	. . 3 ⊢ ((∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑥 = 𝐴) → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
7		encv 6891	. . . . 5 ⊢ (𝑦 ≈ 𝐴 → (𝑦 ∈ V ∧ 𝐴 ∈ V))
8	7	simprd 114	. . . 4 ⊢ (𝑦 ≈ 𝐴 → 𝐴 ∈ V)
9	8	rexlimivw 2644	. . 3 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → 𝐴 ∈ V)
10		intexrabim 4236	. . 3 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} ∈ V)
11	2, 6, 9, 10	fvmptd 5714	. 2 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (card‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
12		onintrab2im 4609	. 2 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} ∈ On)
13	11, 12	eqeltrd 2306	1 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (card‘𝐴) ∈ On)

Syntax hints:   → wi 4   = wceq 1395   ∈ wcel 2200  ∃wrex 2509  {crab 2512  Vcvv 2799  ∩ cint 3922   class class class wbr 4082   ↦ cmpt 4144  Oncon0 4453  ‘cfv 5317   ≈ cen 6883  cardccrd 7345

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-iord 4456  df-on 4458  df-suc 4461  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-iota 5277  df-fun 5319  df-fv 5325  df-en 6886  df-card 7347

This theorem is referenced by:  ficardon  7357