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

Theorem cfval2 10180
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 10167 . 2 (𝐴 ∈ On → (cf‘𝐴) = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))})
2 fvex 6847 . . . 4 (card‘𝑥) ∈ V
32dfiin2 4969 . . 3 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)}
4 df-rex 3065 . . . . . 6 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)))
5 rabid 3413 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
6 velpw 4541 . . . . . . . . . 10 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
76anbi1i 630 . . . . . . . . 9 ((𝑥 ∈ 𝒫 𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤) ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
85, 7bitri 276 . . . . . . . 8 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ↔ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))
98anbi2ci 631 . . . . . . 7 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
109exbii 1855 . . . . . 6 (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
114, 10bitri 276 . . . . 5 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤)))
1211abbii 2807 . . . 4 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))}
1312inteqi 4888 . . 3 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))}
143, 13eqtr2i 2764 . 2 {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥𝐴 ∧ ∀𝑧𝐴𝑤𝑥 𝑧𝑤))} = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥)
151, 14eqtrdi 2791 1 (𝐴 ∈ On → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑧𝐴𝑤𝑥 𝑧𝑤} (card‘𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wex 1786  wcel 2119  {cab 2718  wral 3054  wrex 3064  {crab 3392  wss 3890  𝒫 cpw 4536   cint 4884   ciin 4929  Oncon0 6317  cfv 6492  cardccrd 9857  cfccf 9859
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iin 4931  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-cf 9863
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator