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

Theorem cflim3 10018
Description: Another expression for the cofinality function. (Contributed by Mario Carneiro, 28-Feb-2013.)
Hypothesis
Ref Expression
cflim3.1 𝐴 ∈ V
Assertion
Ref Expression
cflim3 (Lim 𝐴 → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
Distinct variable group:   𝑥,𝐴

Proof of Theorem cflim3
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limord 6325 . . . 4 (Lim 𝐴 → Ord 𝐴)
2 cflim3.1 . . . . 5 𝐴 ∈ V
32elon 6275 . . . 4 (𝐴 ∈ On ↔ Ord 𝐴)
41, 3sylibr 233 . . 3 (Lim 𝐴𝐴 ∈ On)
5 cfval 10003 . . 3 (𝐴 ∈ On → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
64, 5syl 17 . 2 (Lim 𝐴 → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
7 fvex 6787 . . . 4 (card‘𝑥) ∈ V
87dfiin2 4964 . . 3 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
9 df-rex 3070 . . . . . 6 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)))
10 ancom 461 . . . . . . . 8 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}))
11 rabid 3310 . . . . . . . . . 10 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴))
12 velpw 4538 . . . . . . . . . . . 12 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
1312anbi1i 624 . . . . . . . . . . 11 ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 𝑥 = 𝐴))
14 coflim 10017 . . . . . . . . . . . 12 ((Lim 𝐴𝑥𝐴) → ( 𝑥 = 𝐴 ↔ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
1514pm5.32da 579 . . . . . . . . . . 11 (Lim 𝐴 → ((𝑥𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1613, 15bitrid 282 . . . . . . . . . 10 (Lim 𝐴 → ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1711, 16bitrid 282 . . . . . . . . 9 (Lim 𝐴 → (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1817anbi2d 629 . . . . . . . 8 (Lim 𝐴 → ((𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
1910, 18bitrid 282 . . . . . . 7 (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
2019exbidv 1924 . . . . . 6 (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
219, 20bitrid 282 . . . . 5 (Lim 𝐴 → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
2221abbidv 2807 . . . 4 (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
2322inteqd 4884 . . 3 (Lim 𝐴 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
248, 23eqtr2id 2791 . 2 (Lim 𝐴 {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))} = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
256, 24eqtrd 2778 1 (Lim 𝐴 → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wex 1782  wcel 2106  {cab 2715  wral 3064  wrex 3065  {crab 3068  Vcvv 3432  wss 3887  𝒫 cpw 4533   cuni 4839   cint 4879   ciin 4925  Ord word 6265  Oncon0 6266  Lim wlim 6267  cfv 6433  cardccrd 9693  cfccf 9695
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-ord 6269  df-on 6270  df-lim 6271  df-iota 6391  df-fun 6435  df-fv 6441  df-cf 9699
This theorem is referenced by:  cflim2  10019  cfss  10021  cfslb  10022
  Copyright terms: Public domain W3C validator