Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  tfr2ALT Unicode version

Theorem tfr2ALT 24278
Description: tfr2 6414 via well-founded recursion. (Contributed by Scott Fenton, 22-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
tfrALT.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
tfrALT.2  |-  F  = 
U. A
Assertion
Ref Expression
tfr2ALT  |-  ( z  e.  On  ->  ( F `  z )  =  ( G `  ( F  |`  z ) ) )
Distinct variable groups:    f, F, x, y    f, G, x, y    y, z
Allowed substitution hints:    A( x, y, z, f)    F( z)    G( z)

Proof of Theorem tfr2ALT
StepHypRef Expression
1 epweon 4575 . . 3  |-  _E  We  On
2 epse 4376 . . 3  |-  _E Se  On
3 tfrALT.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
4 tfrALTlem 24276 . . . 4  |-  { f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }  =  { f  |  E. x ( f  Fn  x  /\  ( x  C_  On  /\  A. y  e.  x  Pred (  _E  ,  On ,  y )  C_  x )  /\  A. y  e.  x  (
f `  y )  =  ( G `  ( f  |`  Pred (  _E  ,  On ,  y ) ) ) ) }
53, 4eqtri 2303 . . 3  |-  A  =  { f  |  E. x ( f  Fn  x  /\  ( x 
C_  On  /\  A. y  e.  x  Pred (  _E  ,  On ,  y )  C_  x )  /\  A. y  e.  x  ( f `  y
)  =  ( G `
 ( f  |`  Pred (  _E  ,  On ,  y ) ) ) ) }
6 tfrALT.2 . . 3  |-  F  = 
U. A
71, 2, 5, 6wfr2 24273 . 2  |-  ( z  e.  On  ->  ( F `  z )  =  ( G `  ( F  |`  Pred (  _E  ,  On ,  z ) ) ) )
8 predon 24193 . . . 4  |-  ( z  e.  On  ->  Pred (  _E  ,  On ,  z )  =  z )
98reseq2d 4955 . . 3  |-  ( z  e.  On  ->  ( F  |`  Pred (  _E  ,  On ,  z )
)  =  ( F  |`  z ) )
109fveq2d 5529 . 2  |-  ( z  e.  On  ->  ( G `  ( F  |` 
Pred (  _E  ,  On ,  z )
) )  =  ( G `  ( F  |`  z ) ) )
117, 10eqtrd 2315 1  |-  ( z  e.  On  ->  ( F `  z )  =  ( G `  ( F  |`  z ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934   E.wex 1528    = wceq 1623    e. wcel 1684   {cab 2269   A.wral 2543   E.wrex 2544    C_ wss 3152   U.cuni 3827    _E cep 4303   Oncon0 4392    |` cres 4691    Fn wfn 5250   ` cfv 5255   Predcpred 24167
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-se 4353  df-we 4354  df-ord 4395  df-on 4396  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-pred 24168
  Copyright terms: Public domain W3C validator