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

Theorem cfval2 10232
Description: Another expression for the cofinality function. (Contributed by Mario Carneiro, 28-Feb-2013.)
Assertion
Ref Expression
cfval2 (𝐴 ∈ On → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥))
Distinct variable group:   𝑤,𝐴,𝑥,𝑧

Proof of Theorem cfval2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cfval 10218 . 2 (𝐴 ∈ On → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
2 fvex 6884 . . . 4 (card‘𝑥) ∈ V
32dfiin2 4993 . . 3 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)}
4 df-rex 3090 . . . . . 6 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)))
5 rabid 3438 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
6 velpw 4563 . . . . . . . . . 10 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
76anbi1i 635 . . . . . . . . 9 ((𝑥 ∈ 𝒫 𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
85, 7bitri 278 . . . . . . . 8 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
98anbi2ci 636 . . . . . . 7 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
109exbii 1871 . . . . . 6 (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
114, 10bitri 278 . . . . 5 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1211abbii 2832 . . . 4 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))}
1312inteqi 4912 . . 3 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))}
143, 13eqtr2i 2789 . 2 {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))} = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥)
151, 14eqtrdi 2816 1 (𝐴 ∈ On → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wex 1802  wcel 2145  {cab 2743  wral 3079  wrex 3089  {crab 3417  wss 3907  𝒫 cpw 4558   cint 4908   ciin 4953  Oncon0 6350  cfv 6525  cardccrd 9909  cfccf 9911
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iin 4955  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-cf 9915
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator