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

Theorem cflim3 9684
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 236 . . 3 (Lim 𝐴𝐴 ∈ On)
5 cfval 9669 . . 3 (𝐴 ∈ On → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
64, 5syl 17 . 2 (Lim 𝐴 → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
7 fvex 6683 . . . 4 (card‘𝑥) ∈ V
87dfiin2 4959 . . 3 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
9 df-rex 3144 . . . . . 6 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)))
10 ancom 463 . . . . . . . 8 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}))
11 rabid 3378 . . . . . . . . . 10 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴))
12 velpw 4544 . . . . . . . . . . . 12 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
1312anbi1i 625 . . . . . . . . . . 11 ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 𝑥 = 𝐴))
14 coflim 9683 . . . . . . . . . . . 12 ((Lim 𝐴𝑥𝐴) → ( 𝑥 = 𝐴 ↔ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
1514pm5.32da 581 . . . . . . . . . . 11 (Lim 𝐴 → ((𝑥𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1613, 15syl5bb 285 . . . . . . . . . 10 (Lim 𝐴 → ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1711, 16syl5bb 285 . . . . . . . . 9 (Lim 𝐴 → (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1817anbi2d 630 . . . . . . . 8 (Lim 𝐴 → ((𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
1910, 18syl5bb 285 . . . . . . 7 (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
2019exbidv 1922 . . . . . 6 (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
219, 20syl5bb 285 . . . . 5 (Lim 𝐴 → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))))
2221abbidv 2885 . . . 4 (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
2322inteqd 4881 . . 3 (Lim 𝐴 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
248, 23syl5req 2869 . 2 (Lim 𝐴 {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))} = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
256, 24eqtrd 2856 1 (Lim 𝐴 → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wex 1780  wcel 2114  {cab 2799  wral 3138  wrex 3139  {crab 3142  Vcvv 3494  wss 3936  𝒫 cpw 4539   cuni 4838   cint 4876   ciin 4920  Ord word 6190  Oncon0 6191  Lim wlim 6192  cfv 6355  cardccrd 9364  cfccf 9366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-int 4877  df-iin 4922  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-ord 6194  df-on 6195  df-lim 6196  df-iota 6314  df-fun 6357  df-fv 6363  df-cf 9370
This theorem is referenced by:  cflim2  9685  cfss  9687  cfslb  9688
  Copyright terms: Public domain W3C validator