HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem tfr2 3931
Description: Principle of Transfinite Recursion, part 2 of 3. Theorem 7.41(2) of [TakeutiZaring] p. 47. Here we show that the function F has the property that for any function G whatsoever, the "next" value of F is G recursively applied to all "previous" values of F.
Hypotheses
Ref Expression
tfr.1 |- A = {f | E.x e. On (f Fn x /\ A.y e. x (f` y) = (G` (f |` y)))}
tfr.2 |- F = U.A
Assertion
Ref Expression
tfr2 |- (z e. On -> (F` z) = (G` (F |` z)))
Distinct variable groups:   x,y,f,A   x,F,y,f   x,G,y,f   y,z

Proof of Theorem tfr2
StepHypRef Expression
1 fveq2 3730 . . 3 |- (y = z -> (F` y) = (F` z))
2 reseq2 3375 . . . 4 |- (y = z -> (F |` y) = (F |` z))
32fveq2d 3734 . . 3 |- (y = z -> (G` (F |` y)) = (G` (F |` z)))
41, 3eqeq12d 1492 . 2 |- (y = z -> ((F` y) = (G` (F |` y)) <-> (F` z) = (G` (F |` z))))
5 tfr.1 . . . . 5 |- A = {f | E.x e. On (f Fn x /\ A.y e. x (f` y) = (G` (f |` y)))}
6 tfr.2 . . . . 5 |- F = U.A
7 eqid 1478 . . . . 5 |- (F u. {<.dom F, (G` (F |` dom F))>.}) = (F u. {<.dom F, (G` (F |` dom F))>.})
85, 6, 7tfrlem13 3929 . . . 4 |- dom F = On
98eleq2i 1541 . . 3 |- (y e. dom F <-> y e. On)
105, 6tfrlem9 3925 . . 3 |- (y e. dom F -> (F` y) = (G` (F |` y)))
119, 10sylbir 201 . 2 |- (y e. On -> (F` y) = (G` (F |` y)))
124, 11vtoclga 1855 1 |- (z e. On -> (F` z) = (G` (F |` z)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   = wceq 958   e. wcel 960  {cab 1466  A.wral 1648  E.wrex 1649   u. cun 2048  {csn 2413  <.cop 2415  U.cuni 2507  Oncon0 2954  dom cdm 3176   |` cres 3178   Fn wfn 3183  ` cfv 3188
This theorem is referenced by:  tfr3 3932  rdgval 3946  numthlem 4793  zorn2lem1 4798
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-rep 2698  ax-sep 2708  ax-nul 2715  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 778  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-rab 1655  df-v 1815  df-sbc 1945  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-tp 2419  df-op 2420  df-uni 2508  df-iun 2572  df-br 2625  df-opab 2672  df-tr 2686  df-eprel 2838  df-id 2841  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958  df-suc 2960  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-fv 3204
Copyright terms: Public domain