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

Theorem cardcf 9074
Description: Cofinality is a cardinal number. Proposition 11.11 of [TakeutiZaring] p. 103. (Contributed by NM, 24-Apr-2004.) (Revised by Mario Carneiro, 15-Sep-2013.)
Assertion
Ref Expression
cardcf (card‘(cf‘𝐴)) = (cf‘𝐴)

Proof of Theorem cardcf
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cfval 9069 . . . 4 (𝐴 ∈ On → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
2 vex 3203 . . . . . . . . 9 𝑣 ∈ V
3 eqeq1 2626 . . . . . . . . . . 11 (𝑥 = 𝑣 → (𝑥 = (card‘𝑦) ↔ 𝑣 = (card‘𝑦)))
43anbi1d 741 . . . . . . . . . 10 (𝑥 = 𝑣 → ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ (𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))))
54exbidv 1850 . . . . . . . . 9 (𝑥 = 𝑣 → (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ ∃𝑦(𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))))
62, 5elab 3350 . . . . . . . 8 (𝑣 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ↔ ∃𝑦(𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
7 fveq2 6191 . . . . . . . . . . . 12 (𝑣 = (card‘𝑦) → (card‘𝑣) = (card‘(card‘𝑦)))
8 cardidm 8785 . . . . . . . . . . . 12 (card‘(card‘𝑦)) = (card‘𝑦)
97, 8syl6eq 2672 . . . . . . . . . . 11 (𝑣 = (card‘𝑦) → (card‘𝑣) = (card‘𝑦))
10 eqeq2 2633 . . . . . . . . . . 11 (𝑣 = (card‘𝑦) → ((card‘𝑣) = 𝑣 ↔ (card‘𝑣) = (card‘𝑦)))
119, 10mpbird 247 . . . . . . . . . 10 (𝑣 = (card‘𝑦) → (card‘𝑣) = 𝑣)
1211adantr 481 . . . . . . . . 9 ((𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) → (card‘𝑣) = 𝑣)
1312exlimiv 1858 . . . . . . . 8 (∃𝑦(𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) → (card‘𝑣) = 𝑣)
146, 13sylbi 207 . . . . . . 7 (𝑣 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → (card‘𝑣) = 𝑣)
15 cardon 8770 . . . . . . 7 (card‘𝑣) ∈ On
1614, 15syl6eqelr 2710 . . . . . 6 (𝑣 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → 𝑣 ∈ On)
1716ssriv 3607 . . . . 5 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ On
18 fvex 6201 . . . . . . 7 (cf‘𝐴) ∈ V
191, 18syl6eqelr 2710 . . . . . 6 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ V)
20 intex 4820 . . . . . 6 ({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ≠ ∅ ↔ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ V)
2119, 20sylibr 224 . . . . 5 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ≠ ∅)
22 onint 6995 . . . . 5 (({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ On ∧ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ≠ ∅) → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
2317, 21, 22sylancr 695 . . . 4 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
241, 23eqeltrd 2701 . . 3 (𝐴 ∈ On → (cf‘𝐴) ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
25 fveq2 6191 . . . . 5 (𝑣 = (cf‘𝐴) → (card‘𝑣) = (card‘(cf‘𝐴)))
26 id 22 . . . . 5 (𝑣 = (cf‘𝐴) → 𝑣 = (cf‘𝐴))
2725, 26eqeq12d 2637 . . . 4 (𝑣 = (cf‘𝐴) → ((card‘𝑣) = 𝑣 ↔ (card‘(cf‘𝐴)) = (cf‘𝐴)))
2827, 14vtoclga 3272 . . 3 ((cf‘𝐴) ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → (card‘(cf‘𝐴)) = (cf‘𝐴))
2924, 28syl 17 . 2 (𝐴 ∈ On → (card‘(cf‘𝐴)) = (cf‘𝐴))
30 cff 9070 . . . . . 6 cf:On⟶On
3130fdmi 6052 . . . . 5 dom cf = On
3231eleq2i 2693 . . . 4 (𝐴 ∈ dom cf ↔ 𝐴 ∈ On)
33 ndmfv 6218 . . . 4 𝐴 ∈ dom cf → (cf‘𝐴) = ∅)
3432, 33sylnbir 321 . . 3 𝐴 ∈ On → (cf‘𝐴) = ∅)
35 card0 8784 . . . 4 (card‘∅) = ∅
36 fveq2 6191 . . . 4 ((cf‘𝐴) = ∅ → (card‘(cf‘𝐴)) = (card‘∅))
37 id 22 . . . 4 ((cf‘𝐴) = ∅ → (cf‘𝐴) = ∅)
3835, 36, 373eqtr4a 2682 . . 3 ((cf‘𝐴) = ∅ → (card‘(cf‘𝐴)) = (cf‘𝐴))
3934, 38syl 17 . 2 𝐴 ∈ On → (card‘(cf‘𝐴)) = (cf‘𝐴))
4029, 39pm2.61i 176 1 (card‘(cf‘𝐴)) = (cf‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 384   = wceq 1483  wex 1704  wcel 1990  {cab 2608  wne 2794  wral 2912  wrex 2913  Vcvv 3200  wss 3574  c0 3915   cint 4475  dom cdm 5114  Oncon0 5723  cfv 5888  cardccrd 8761  cfccf 8763
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-er 7742  df-en 7956  df-card 8765  df-cf 8767
This theorem is referenced by:  cfon  9077  winacard  9514
  Copyright terms: Public domain W3C validator