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

Theorem cfval2 9682
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 9669 . 2 (𝐴 ∈ On → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
2 fvex 6683 . . . 4 (card‘𝑥) ∈ V
32dfiin2 4959 . . 3 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)}
4 df-rex 3144 . . . . . 6 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)))
5 rabid 3378 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
6 velpw 4544 . . . . . . . . . 10 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
76anbi1i 625 . . . . . . . . 9 ((𝑥 ∈ 𝒫 𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
85, 7bitri 277 . . . . . . . 8 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
98anbi2ci 626 . . . . . . 7 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
109exbii 1848 . . . . . 6 (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
114, 10bitri 277 . . . . 5 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1211abbii 2886 . . . 4 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))}
1312inteqi 4880 . . 3 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))}
143, 13eqtr2i 2845 . 2 {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))} = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥)
151, 14syl6eq 2872 1 (𝐴 ∈ On → (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  wss 3936  𝒫 cpw 4539   cint 4876   ciin 4920  Oncon0 6191  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-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-iota 6314  df-fun 6357  df-fv 6363  df-cf 9370
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator