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

Theorem r1sucg 9679
Description: Value of the cumulative hierarchy of sets function at a successor ordinal. Part of Definition 9.9 of [TakeutiZaring] p. 76. (Contributed by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
r1sucg (𝐴 ∈ dom 𝑅1 → (𝑅1‘suc 𝐴) = 𝒫 (𝑅1𝐴))

Proof of Theorem r1sucg
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 rdgsucg 8352 . . 3 (𝐴 ∈ dom rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅) → (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘suc 𝐴) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴)))
2 df-r1 9674 . . . 4 𝑅1 = rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)
32dmeqi 5851 . . 3 dom 𝑅1 = dom rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)
41, 3eleq2s 2852 . 2 (𝐴 ∈ dom 𝑅1 → (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘suc 𝐴) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴)))
52fveq1i 6833 . 2 (𝑅1‘suc 𝐴) = (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘suc 𝐴)
6 fvex 6845 . . . 4 (𝑅1𝐴) ∈ V
7 pweq 4566 . . . . 5 (𝑥 = (𝑅1𝐴) → 𝒫 𝑥 = 𝒫 (𝑅1𝐴))
8 eqid 2734 . . . . 5 (𝑥 ∈ V ↦ 𝒫 𝑥) = (𝑥 ∈ V ↦ 𝒫 𝑥)
96pwex 5323 . . . . 5 𝒫 (𝑅1𝐴) ∈ V
107, 8, 9fvmpt 6939 . . . 4 ((𝑅1𝐴) ∈ V → ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(𝑅1𝐴)) = 𝒫 (𝑅1𝐴))
116, 10ax-mp 5 . . 3 ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(𝑅1𝐴)) = 𝒫 (𝑅1𝐴)
122fveq1i 6833 . . . 4 (𝑅1𝐴) = (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴)
1312fveq2i 6835 . . 3 ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(𝑅1𝐴)) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴))
1411, 13eqtr3i 2759 . 2 𝒫 (𝑅1𝐴) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴))
154, 5, 143eqtr4g 2794 1 (𝐴 ∈ dom 𝑅1 → (𝑅1‘suc 𝐴) = 𝒫 (𝑅1𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  Vcvv 3438  c0 4283  𝒫 cpw 4552  cmpt 5177  dom cdm 5622  suc csuc 6317  cfv 6490  reccrdg 8338  𝑅1cr1 9672
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-r1 9674
This theorem is referenced by:  r1suc  9680  r1fin  9683  r1tr  9686  r1ordg  9688  r1pwss  9694  r1val1  9696  rankwflemb  9703  r1elwf  9706  rankr1ai  9708  rankr1bg  9713  pwwf  9717  unwf  9720  uniwf  9729  rankonidlem  9738  rankr1id  9772  r11  35199  r12  35200
  Copyright terms: Public domain W3C validator