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

Theorem cardcf 8957
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 8952 . . . 4 (𝐴 ∈ On → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
2 vex 3176 . . . . . . . . 9 𝑣 ∈ V
3 eqeq1 2614 . . . . . . . . . . 11 (𝑥 = 𝑣 → (𝑥 = (card‘𝑦) ↔ 𝑣 = (card‘𝑦)))
43anbi1d 737 . . . . . . . . . 10 (𝑥 = 𝑣 → ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ (𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))))
54exbidv 1837 . . . . . . . . 9 (𝑥 = 𝑣 → (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ ∃𝑦(𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))))
62, 5elab 3319 . . . . . . . 8 (𝑣 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ↔ ∃𝑦(𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
7 fveq2 6103 . . . . . . . . . . . 12 (𝑣 = (card‘𝑦) → (card‘𝑣) = (card‘(card‘𝑦)))
8 cardidm 8668 . . . . . . . . . . . 12 (card‘(card‘𝑦)) = (card‘𝑦)
97, 8syl6eq 2660 . . . . . . . . . . 11 (𝑣 = (card‘𝑦) → (card‘𝑣) = (card‘𝑦))
10 eqeq2 2621 . . . . . . . . . . 11 (𝑣 = (card‘𝑦) → ((card‘𝑣) = 𝑣 ↔ (card‘𝑣) = (card‘𝑦)))
119, 10mpbird 246 . . . . . . . . . 10 (𝑣 = (card‘𝑦) → (card‘𝑣) = 𝑣)
1211adantr 480 . . . . . . . . 9 ((𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) → (card‘𝑣) = 𝑣)
1312exlimiv 1845 . . . . . . . 8 (∃𝑦(𝑣 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) → (card‘𝑣) = 𝑣)
146, 13sylbi 206 . . . . . . 7 (𝑣 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → (card‘𝑣) = 𝑣)
15 cardon 8653 . . . . . . 7 (card‘𝑣) ∈ On
1614, 15syl6eqelr 2697 . . . . . 6 (𝑣 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → 𝑣 ∈ On)
1716ssriv 3572 . . . . 5 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ On
18 fvex 6113 . . . . . . 7 (cf‘𝐴) ∈ V
191, 18syl6eqelr 2697 . . . . . 6 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ V)
20 intex 4747 . . . . . 6 ({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ≠ ∅ ↔ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ V)
2119, 20sylibr 223 . . . . 5 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ≠ ∅)
22 onint 6887 . . . . 5 (({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ On ∧ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ≠ ∅) → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
2317, 21, 22sylancr 694 . . . 4 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
241, 23eqeltrd 2688 . . 3 (𝐴 ∈ On → (cf‘𝐴) ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
25 fveq2 6103 . . . . 5 (𝑣 = (cf‘𝐴) → (card‘𝑣) = (card‘(cf‘𝐴)))
26 id 22 . . . . 5 (𝑣 = (cf‘𝐴) → 𝑣 = (cf‘𝐴))
2725, 26eqeq12d 2625 . . . 4 (𝑣 = (cf‘𝐴) → ((card‘𝑣) = 𝑣 ↔ (card‘(cf‘𝐴)) = (cf‘𝐴)))
2827, 14vtoclga 3245 . . 3 ((cf‘𝐴) ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → (card‘(cf‘𝐴)) = (cf‘𝐴))
2924, 28syl 17 . 2 (𝐴 ∈ On → (card‘(cf‘𝐴)) = (cf‘𝐴))
30 cff 8953 . . . . . 6 cf:On⟶On
3130fdmi 5965 . . . . 5 dom cf = On
3231eleq2i 2680 . . . 4 (𝐴 ∈ dom cf ↔ 𝐴 ∈ On)
33 ndmfv 6128 . . . 4 𝐴 ∈ dom cf → (cf‘𝐴) = ∅)
3432, 33sylnbir 320 . . 3 𝐴 ∈ On → (cf‘𝐴) = ∅)
35 card0 8667 . . . 4 (card‘∅) = ∅
36 fveq2 6103 . . . 4 ((cf‘𝐴) = ∅ → (card‘(cf‘𝐴)) = (card‘∅))
37 id 22 . . . 4 ((cf‘𝐴) = ∅ → (cf‘𝐴) = ∅)
3835, 36, 373eqtr4a 2670 . . 3 ((cf‘𝐴) = ∅ → (card‘(cf‘𝐴)) = (cf‘𝐴))
3934, 38syl 17 . 2 𝐴 ∈ On → (card‘(cf‘𝐴)) = (cf‘𝐴))
4029, 39pm2.61i 175 1 (card‘(cf‘𝐴)) = (cf‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 383   = wceq 1475  wex 1695  wcel 1977  {cab 2596  wne 2780  wral 2896  wrex 2897  Vcvv 3173  wss 3540  c0 3874   cint 4410  dom cdm 5038  Oncon0 5640  cfv 5804  cardccrd 8644  cfccf 8646
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-ord 5643  df-on 5644  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-er 7629  df-en 7842  df-card 8648  df-cf 8650
This theorem is referenced by:  cfon  8960  winacard  9393
  Copyright terms: Public domain W3C validator