HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version
Theorem rdgval 3925
Description: Value of the recursive definition generator.
Assertion
Ref Expression
rdgval |- (g e. On -> (rec(F, A)` g) = ({<.w, z>. | ((w = (/) /\ z = A) \/ (-. (w = (/) \/ Lim dom w) /\ z = (F` (w` U.dom w))) \/ (Lim dom w /\ z = U.ran w))}` (rec(F, A) |` g)))
Distinct variable groups:   z,g,w,F   z,A,g,w
Proof of Theorem rdgval
StepHypRef Expression
1 rdglem1 3922 . . 3 |- {w | E.u e. On (w Fn u /\ A.v e. u (w` v) = ({<.g, z>. | ((g = (/) /\ z = A) \/ (-. (g = (/) \/ Lim dom g) /\ z = (F` (g` U.dom g))) \/ (Lim dom g /\ z = U.ran g))}` (w |` v)))} = {f | E.x e. On (f Fn x /\ A.y e. x (f` y) = ({<.g, z>. | ((g = (/) /\ z = A) \/ (-. (g = (/) \/ Lim dom g) /\ z = (F` (g` U.dom g))) \/ (Lim dom g /\ z = U.ran g))}` (f |` y)))}
2 dfrdg2 3918 . . 3 |- rec(F, A) = U.{w | E.u e. On (w Fn u /\ A.v e. u (w` v) = ({<.g, z>. | ((g = (/) /\ z = A) \/ (-. (g = (/) \/ Lim dom g) /\ z = (F` (g` U.dom g))) \/ (Lim dom g /\ z = U.ran g))}` (w |` v)))}
31, 2tfr2 3910 . 2 |- (g e. On -> (rec(F, A)` g) = ({<.g, z>. | ((g = (/) /\ z = A) \/ (-. (g = (/) \/ Lim dom g) /\ z = (F` (g` U.dom g))) \/ (Lim dom g /\ z = U.ran g))}` (rec(F, A) |` g)))
4 rdglem2 3923 . . 3 |- {<.g, z>. | ((g = (/) /\ z = A) \/ (-. (g = (/) \/ Lim dom g) /\ z = (F` (g` U.dom g))) \/ (Lim dom g /\ z = U.ran g))} = {<.w, z>. | ((w = (/) /\ z = A) \/ (-. (w = (/) \/ Lim dom w) /\ z = (F` (w` U.dom w))) \/ (Lim dom w /\ z = U.ran w))}
54fveq1i 3710 . 2 |- ({<.g, z>. | ((g = (/) /\ z = A) \/ (-. (g = (/) \/ Lim dom g) /\ z = (F` (g` U.dom g))) \/ (Lim dom g /\ z = U.ran g))}` (rec(F, A) |` g)) = ({<.w, z>. | ((w = (/) /\ z = A) \/ (-. (w = (/) \/ Lim dom w) /\ z = (F` (w` U.dom w))) \/ (Lim dom w /\ z = U.ran w))}` (rec(F, A) |` g))
63, 5syl6eq 1515 1 |- (g e. On -> (rec(F, A)` g) = ({<.w, z>. | ((w = (/) /\ z = A) \/ (-. (w = (/) \/ Lim dom w) /\ z = (F` (w` U.dom w))) \/ (Lim dom w /\ z = U.ran w))}` (rec(F, A) |` g)))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 222   /\ wa 223   \/ w3o 772   = wceq 953   e. wcel 955  {cab 1456  A.wral 1637  E.wrex 1638  (/)c0 2270  U.cuni 2493  {copab 2656  Oncon0 2938  Lim wlim 2939  dom cdm 3160  ran crn 3161   |` cres 3162   Fn wfn 3167  ` cfv 3172  reccrdg 3916
This theorem is referenced by:  rdg0 3926  rdgsuc 3927  rdglim 3928
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-rep 2683  ax-sep 2693  ax-nul 2700  ax-pow 2732  ax-pr 2769  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-rab 1644  df-v 1803  df-sbc 1932  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-if 2352  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-iun 2558  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-id 2824  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-lim 2943  df-suc 2944  df-xp 3174  df-rel 3175  df-cnv 3176  df-co 3177  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181  df-fun 3182  df-fn 3183  df-fv 3188  df-rdg 3917
Copyright terms: Public domain