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

Theorem cflm 10319
Description: Value of the cofinality function at a limit ordinal. Part of Definition of cofinality of [Enderton] p. 257. (Contributed by NM, 26-Apr-2004.)
Assertion
Ref Expression
cflm ((𝐴𝐵 ∧ Lim 𝐴) → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))})
Distinct variable group:   𝑥,𝑦,𝐴
Allowed substitution hints:   𝐵(𝑥,𝑦)

Proof of Theorem cflm
Dummy variables 𝑧 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3509 . 2 (𝐴𝐵𝐴 ∈ V)
2 limsuc 7886 . . . . . . . . . . . . . . . . . 18 (Lim 𝐴 → (𝑣𝐴 ↔ suc 𝑣𝐴))
32biimpd 229 . . . . . . . . . . . . . . . . 17 (Lim 𝐴 → (𝑣𝐴 → suc 𝑣𝐴))
4 sseq1 4034 . . . . . . . . . . . . . . . . . . . 20 (𝑧 = suc 𝑣 → (𝑧𝑤 ↔ suc 𝑣𝑤))
54rexbidv 3185 . . . . . . . . . . . . . . . . . . 19 (𝑧 = suc 𝑣 → (∃𝑤𝑦 𝑧𝑤 ↔ ∃𝑤𝑦 suc 𝑣𝑤))
65rspcv 3631 . . . . . . . . . . . . . . . . . 18 (suc 𝑣𝐴 → (∀𝑧𝐴𝑤𝑦 𝑧𝑤 → ∃𝑤𝑦 suc 𝑣𝑤))
7 sucssel 6490 . . . . . . . . . . . . . . . . . . . . 21 (𝑣 ∈ V → (suc 𝑣𝑤𝑣𝑤))
87elv 3493 . . . . . . . . . . . . . . . . . . . 20 (suc 𝑣𝑤𝑣𝑤)
98reximi 3090 . . . . . . . . . . . . . . . . . . 19 (∃𝑤𝑦 suc 𝑣𝑤 → ∃𝑤𝑦 𝑣𝑤)
10 eluni2 4935 . . . . . . . . . . . . . . . . . . 19 (𝑣 𝑦 ↔ ∃𝑤𝑦 𝑣𝑤)
119, 10sylibr 234 . . . . . . . . . . . . . . . . . 18 (∃𝑤𝑦 suc 𝑣𝑤𝑣 𝑦)
126, 11syl6com 37 . . . . . . . . . . . . . . . . 17 (∀𝑧𝐴𝑤𝑦 𝑧𝑤 → (suc 𝑣𝐴𝑣 𝑦))
133, 12syl9 77 . . . . . . . . . . . . . . . 16 (Lim 𝐴 → (∀𝑧𝐴𝑤𝑦 𝑧𝑤 → (𝑣𝐴𝑣 𝑦)))
1413ralrimdv 3158 . . . . . . . . . . . . . . 15 (Lim 𝐴 → (∀𝑧𝐴𝑤𝑦 𝑧𝑤 → ∀𝑣𝐴 𝑣 𝑦))
15 dfss3 3997 . . . . . . . . . . . . . . 15 (𝐴 𝑦 ↔ ∀𝑣𝐴 𝑣 𝑦)
1614, 15imbitrrdi 252 . . . . . . . . . . . . . 14 (Lim 𝐴 → (∀𝑧𝐴𝑤𝑦 𝑧𝑤𝐴 𝑦))
1716adantr 480 . . . . . . . . . . . . 13 ((Lim 𝐴𝑦𝐴) → (∀𝑧𝐴𝑤𝑦 𝑧𝑤𝐴 𝑦))
18 uniss 4939 . . . . . . . . . . . . . . 15 (𝑦𝐴 𝑦 𝐴)
19 limuni 6456 . . . . . . . . . . . . . . . 16 (Lim 𝐴𝐴 = 𝐴)
2019sseq2d 4041 . . . . . . . . . . . . . . 15 (Lim 𝐴 → ( 𝑦𝐴 𝑦 𝐴))
2118, 20imbitrrid 246 . . . . . . . . . . . . . 14 (Lim 𝐴 → (𝑦𝐴 𝑦𝐴))
2221imp 406 . . . . . . . . . . . . 13 ((Lim 𝐴𝑦𝐴) → 𝑦𝐴)
2317, 22jctird 526 . . . . . . . . . . . 12 ((Lim 𝐴𝑦𝐴) → (∀𝑧𝐴𝑤𝑦 𝑧𝑤 → (𝐴 𝑦 𝑦𝐴)))
24 eqss 4024 . . . . . . . . . . . 12 (𝐴 = 𝑦 ↔ (𝐴 𝑦 𝑦𝐴))
2523, 24imbitrrdi 252 . . . . . . . . . . 11 ((Lim 𝐴𝑦𝐴) → (∀𝑧𝐴𝑤𝑦 𝑧𝑤𝐴 = 𝑦))
2625imdistanda 571 . . . . . . . . . 10 (Lim 𝐴 → ((𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤) → (𝑦𝐴𝐴 = 𝑦)))
2726anim2d 611 . . . . . . . . 9 (Lim 𝐴 → ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) → (𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))))
2827eximdv 1916 . . . . . . . 8 (Lim 𝐴 → (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))))
2928ss2abdv 4089 . . . . . . 7 (Lim 𝐴 → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))})
30 intss 4993 . . . . . . 7 ({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
3129, 30syl 17 . . . . . 6 (Lim 𝐴 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
3231adantl 481 . . . . 5 ((𝐴 ∈ V ∧ Lim 𝐴) → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
33 limelon 6459 . . . . . 6 ((𝐴 ∈ V ∧ Lim 𝐴) → 𝐴 ∈ On)
34 cfval 10316 . . . . . 6 (𝐴 ∈ On → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
3533, 34syl 17 . . . . 5 ((𝐴 ∈ V ∧ Lim 𝐴) → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
3632, 35sseqtrrd 4050 . . . 4 ((𝐴 ∈ V ∧ Lim 𝐴) → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ (cf‘𝐴))
37 cfub 10318 . . . . 5 (cf‘𝐴) ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦))}
38 eqimss 4067 . . . . . . . . . 10 (𝐴 = 𝑦𝐴 𝑦)
3938anim2i 616 . . . . . . . . 9 ((𝑦𝐴𝐴 = 𝑦) → (𝑦𝐴𝐴 𝑦))
4039anim2i 616 . . . . . . . 8 ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦)) → (𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦)))
4140eximi 1833 . . . . . . 7 (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦)))
4241ss2abi 4090 . . . . . 6 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦))}
43 intss 4993 . . . . . 6 ({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦))} → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))})
4442, 43ax-mp 5 . . . . 5 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))}
4537, 44sstri 4018 . . . 4 (cf‘𝐴) ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))}
4636, 45jctil 519 . . 3 ((𝐴 ∈ V ∧ Lim 𝐴) → ((cf‘𝐴) ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ∧ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ (cf‘𝐴)))
47 eqss 4024 . . 3 ((cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ↔ ((cf‘𝐴) ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ∧ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))} ⊆ (cf‘𝐴)))
4846, 47sylibr 234 . 2 ((𝐴 ∈ V ∧ Lim 𝐴) → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))})
491, 48sylan 579 1 ((𝐴𝐵 ∧ Lim 𝐴) → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴𝐴 = 𝑦))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wex 1777  wcel 2108  {cab 2717  wral 3067  wrex 3076  Vcvv 3488  wss 3976   cuni 4931   cint 4970  Oncon0 6395  Lim wlim 6396  suc csuc 6397  cfv 6573  cardccrd 10004  cfccf 10006
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-card 10008  df-cf 10010
This theorem is referenced by:  gruina  10887
  Copyright terms: Public domain W3C validator