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

Theorem r1sucg 9693
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 8364 . . 3 (𝐴 ∈ dom rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅) → (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘suc 𝐴) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴)))
2 df-r1 9688 . . . 4 𝑅1 = rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)
32dmeqi 5861 . . 3 dom 𝑅1 = dom rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)
41, 3eleq2s 2855 . 2 (𝐴 ∈ dom 𝑅1 → (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘suc 𝐴) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴)))
52fveq1i 6843 . 2 (𝑅1‘suc 𝐴) = (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘suc 𝐴)
6 fvex 6855 . . . 4 (𝑅1𝐴) ∈ V
7 pweq 4570 . . . . 5 (𝑥 = (𝑅1𝐴) → 𝒫 𝑥 = 𝒫 (𝑅1𝐴))
8 eqid 2737 . . . . 5 (𝑥 ∈ V ↦ 𝒫 𝑥) = (𝑥 ∈ V ↦ 𝒫 𝑥)
96pwex 5327 . . . . 5 𝒫 (𝑅1𝐴) ∈ V
107, 8, 9fvmpt 6949 . . . 4 ((𝑅1𝐴) ∈ V → ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(𝑅1𝐴)) = 𝒫 (𝑅1𝐴))
116, 10ax-mp 5 . . 3 ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(𝑅1𝐴)) = 𝒫 (𝑅1𝐴)
122fveq1i 6843 . . . 4 (𝑅1𝐴) = (rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴)
1312fveq2i 6845 . . 3 ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(𝑅1𝐴)) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴))
1411, 13eqtr3i 2762 . 2 𝒫 (𝑅1𝐴) = ((𝑥 ∈ V ↦ 𝒫 𝑥)‘(rec((𝑥 ∈ V ↦ 𝒫 𝑥), ∅)‘𝐴))
154, 5, 143eqtr4g 2797 1 (𝐴 ∈ dom 𝑅1 → (𝑅1‘suc 𝐴) = 𝒫 (𝑅1𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  c0 4287  𝒫 cpw 4556  cmpt 5181  dom cdm 5632  suc csuc 6327  cfv 6500  reccrdg 8350  𝑅1cr1 9686
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-r1 9688
This theorem is referenced by:  r1suc  9694  r1fin  9697  r1tr  9700  r1ordg  9702  r1pwss  9708  r1val1  9710  rankwflemb  9717  r1elwf  9720  rankr1ai  9722  rankr1bg  9727  pwwf  9731  unwf  9734  uniwf  9743  rankonidlem  9752  rankr1id  9786  r11  35271  r12  35272
  Copyright terms: Public domain W3C validator