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

Theorem rdgsucg 8342
Description: The value of the recursive definition generator at a successor. (Contributed by NM, 16-Nov-2014.)
Assertion
Ref Expression
rdgsucg (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵)))

Proof of Theorem rdgsucg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rdgdmlim 8336 . . 3 Lim dom rec(𝐹, 𝐴)
2 limsuc 7779 . . 3 (Lim dom rec(𝐹, 𝐴) → (𝐵 ∈ dom rec(𝐹, 𝐴) ↔ suc 𝐵 ∈ dom rec(𝐹, 𝐴)))
31, 2ax-mp 5 . 2 (𝐵 ∈ dom rec(𝐹, 𝐴) ↔ suc 𝐵 ∈ dom rec(𝐹, 𝐴))
4 eqid 2731 . . 3 (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐹‘(𝑥 dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐹‘(𝑥 dom 𝑥)))))
5 rdgvalg 8338 . . 3 (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐹‘(𝑥 dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦)))
6 rdgseg 8341 . . 3 (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴) ↾ 𝑦) ∈ V)
7 rdgfun 8335 . . . 4 Fun rec(𝐹, 𝐴)
8 funfn 6511 . . . 4 (Fun rec(𝐹, 𝐴) ↔ rec(𝐹, 𝐴) Fn dom rec(𝐹, 𝐴))
97, 8mpbi 230 . . 3 rec(𝐹, 𝐴) Fn dom rec(𝐹, 𝐴)
10 limord 6367 . . . 4 (Lim dom rec(𝐹, 𝐴) → Ord dom rec(𝐹, 𝐴))
111, 10ax-mp 5 . . 3 Ord dom rec(𝐹, 𝐴)
124, 5, 6, 9, 11tz7.44-2 8326 . 2 (suc 𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵)))
133, 12sylbi 217 1 (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1541  wcel 2111  Vcvv 3436  c0 4283  ifcif 4475   cuni 4859  cmpt 5172  dom cdm 5616  ran crn 5617  Ord word 6305  Lim wlim 6307  suc csuc 6308  Fun wfun 6475   Fn wfn 6476  cfv 6481  reccrdg 8328
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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370  ax-un 7668
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 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329
This theorem is referenced by:  rdgsuc  8343  rdgsucmptnf  8348  frsuc  8356  r1sucg  9659
  Copyright terms: Public domain W3C validator