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

Theorem cflim3 9841
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 6250 . . . 4 (Lim 𝐴 → Ord 𝐴)
2 cflim3.1 . . . . 5 𝐴 ∈ V
32elon 6200 . . . 4 (𝐴 ∈ On ↔ Ord 𝐴)
41, 3sylibr 237 . . 3 (Lim 𝐴𝐴 ∈ On)
5 cfval 9826 . . 3 (𝐴 ∈ On → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
64, 5syl 17 . 2 (Lim 𝐴 → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
7 fvex 6708 . . . 4 (card‘𝑥) ∈ V
87dfiin2 4929 . . 3 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
9 df-rex 3057 . . . . . 6 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)))
10 ancom 464 . . . . . . . 8 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}))
11 rabid 3280 . . . . . . . . . 10 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴))
12 velpw 4504 . . . . . . . . . . . 12 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
1312anbi1i 627 . . . . . . . . . . 11 ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 𝑥 = 𝐴))
14 coflim 9840 . . . . . . . . . . . 12 ((Lim 𝐴𝑥𝐴) → ( 𝑥 = 𝐴 ↔ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
1514pm5.32da 582 . . . . . . . . . . 11 (Lim 𝐴 → ((𝑥𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1613, 15syl5bb 286 . . . . . . . . . 10 (Lim 𝐴 → ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1711, 16syl5bb 286 . . . . . . . . 9 (Lim 𝐴 → (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1817anbi2d 632 . . . . . . . 8 (Lim 𝐴 → ((𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
1910, 18syl5bb 286 . . . . . . 7 (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
2019exbidv 1929 . . . . . 6 (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
219, 20syl5bb 286 . . . . 5 (Lim 𝐴 → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
2221abbidv 2800 . . . 4 (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
2322inteqd 4850 . . 3 (Lim 𝐴 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
248, 23eqtr2id 2784 . 2 (Lim 𝐴 {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))} = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
256, 24eqtrd 2771 1 (Lim 𝐴 → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1543  wex 1787  wcel 2112  {cab 2714  wral 3051  wrex 3052  {crab 3055  Vcvv 3398  wss 3853  𝒫 cpw 4499   cuni 4805   cint 4845   ciin 4891  Ord word 6190  Oncon0 6191  Lim wlim 6192  cfv 6358  cardccrd 9516  cfccf 9518
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-int 4846  df-iin 4893  df-br 5040  df-opab 5102  df-mpt 5121  df-tr 5147  df-id 5440  df-eprel 5445  df-po 5453  df-so 5454  df-fr 5494  df-we 5496  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-ord 6194  df-on 6195  df-lim 6196  df-iota 6316  df-fun 6360  df-fv 6366  df-cf 9522
This theorem is referenced by:  cflim2  9842  cfss  9844  cfslb  9845
  Copyright terms: Public domain W3C validator