ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cardcl GIF version

Theorem cardcl 7158
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.
StepHypRef Expression
1 df-card 7157 . . . 4 card = (𝑥 ∈ V ↦ {𝑦 ∈ On ∣ 𝑦𝑥})
21a1i 9 . . 3 (∃𝑦 ∈ On 𝑦𝐴 → card = (𝑥 ∈ V ↦ {𝑦 ∈ On ∣ 𝑦𝑥}))
3 breq2 3993 . . . . . 6 (𝑥 = 𝐴 → (𝑦𝑥𝑦𝐴))
43rabbidv 2719 . . . . 5 (𝑥 = 𝐴 → {𝑦 ∈ On ∣ 𝑦𝑥} = {𝑦 ∈ On ∣ 𝑦𝐴})
54inteqd 3836 . . . 4 (𝑥 = 𝐴 {𝑦 ∈ On ∣ 𝑦𝑥} = {𝑦 ∈ On ∣ 𝑦𝐴})
65adantl 275 . . 3 ((∃𝑦 ∈ On 𝑦𝐴𝑥 = 𝐴) → {𝑦 ∈ On ∣ 𝑦𝑥} = {𝑦 ∈ On ∣ 𝑦𝐴})
7 encv 6724 . . . . 5 (𝑦𝐴 → (𝑦 ∈ V ∧ 𝐴 ∈ V))
87simprd 113 . . . 4 (𝑦𝐴𝐴 ∈ V)
98rexlimivw 2583 . . 3 (∃𝑦 ∈ On 𝑦𝐴𝐴 ∈ V)
10 intexrabim 4139 . . 3 (∃𝑦 ∈ On 𝑦𝐴 {𝑦 ∈ On ∣ 𝑦𝐴} ∈ V)
112, 6, 9, 10fvmptd 5577 . 2 (∃𝑦 ∈ On 𝑦𝐴 → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
12 onintrab2im 4502 . 2 (∃𝑦 ∈ On 𝑦𝐴 {𝑦 ∈ On ∣ 𝑦𝐴} ∈ On)
1311, 12eqeltrd 2247 1 (∃𝑦 ∈ On 𝑦𝐴 → (card‘𝐴) ∈ On)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1348  wcel 2141  wrex 2449  {crab 2452  Vcvv 2730   cint 3831   class class class wbr 3989  cmpt 4050  Oncon0 4348  cfv 5198  cen 6716  cardccrd 7156
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-en 6719  df-card 7157
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator