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

Theorem rdgsucg 8336
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 8330 . . 3 Lim dom rec(𝐹, 𝐴)
2 limsuc 7773 . . 3 (Lim dom rec(𝐹, 𝐴) → (𝐵 ∈ dom rec(𝐹, 𝐴) ↔ suc 𝐵 ∈ dom rec(𝐹, 𝐴)))
31, 2ax-mp 5 . 2 (𝐵 ∈ dom rec(𝐹, 𝐴) ↔ suc 𝐵 ∈ dom rec(𝐹, 𝐴))
4 eqid 2729 . . 3 (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐹‘(𝑥 dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐹‘(𝑥 dom 𝑥)))))
5 rdgvalg 8332 . . 3 (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ran 𝑥, (𝐹‘(𝑥 dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦)))
6 rdgseg 8335 . . 3 (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴) ↾ 𝑦) ∈ V)
7 rdgfun 8329 . . . 4 Fun rec(𝐹, 𝐴)
8 funfn 6506 . . . 4 (Fun rec(𝐹, 𝐴) ↔ rec(𝐹, 𝐴) Fn dom rec(𝐹, 𝐴))
97, 8mpbi 230 . . 3 rec(𝐹, 𝐴) Fn dom rec(𝐹, 𝐴)
10 limord 6362 . . . 4 (Lim dom rec(𝐹, 𝐴) → Ord dom rec(𝐹, 𝐴))
111, 10ax-mp 5 . . 3 Ord dom rec(𝐹, 𝐴)
124, 5, 6, 9, 11tz7.44-2 8320 . 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 1540  wcel 2109  Vcvv 3433  c0 4280  ifcif 4472   cuni 4856  cmpt 5169  dom cdm 5613  ran crn 5614  Ord word 6300  Lim wlim 6302  suc csuc 6303  Fun wfun 6470   Fn wfn 6471  cfv 6476  reccrdg 8322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5231  ax-nul 5241  ax-pr 5367  ax-un 7662
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3393  df-v 3435  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4940  df-br 5089  df-opab 5151  df-mpt 5170  df-tr 5196  df-id 5508  df-eprel 5513  df-po 5521  df-so 5522  df-fr 5566  df-we 5568  df-xp 5619  df-rel 5620  df-cnv 5621  df-co 5622  df-dm 5623  df-rn 5624  df-res 5625  df-ima 5626  df-pred 6243  df-ord 6304  df-on 6305  df-lim 6306  df-suc 6307  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-ov 7343  df-2nd 7916  df-frecs 8205  df-wrecs 8236  df-recs 8285  df-rdg 8323
This theorem is referenced by:  rdgsuc  8337  rdgsucmptnf  8342  frsuc  8350  r1sucg  9653
  Copyright terms: Public domain W3C validator