ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfri3 Unicode version

Theorem tfri3 5984
Description: Principle of Transfinite Recursion, part 3 of 3. Theorem 7.41(3) of [TakeutiZaring] p. 47, with an additional condition on the recursion rule  G ( as described at tfri1 5982). Finally, we show that  F is unique. We do this by showing that any class  B with the same properties of  F that we showed in parts 1 and 2 is identical to  F. (Contributed by Jim Kingdon, 4-May-2019.)
Hypotheses
Ref Expression
tfri3.1  |-  F  = recs ( G )
tfri3.2  |-  ( Fun 
G  /\  ( G `  x )  e.  _V )
Assertion
Ref Expression
tfri3  |-  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  B  =  F )
Distinct variable groups:    x, B    x, F    x, G

Proof of Theorem tfri3
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 nfv 1437 . . . 4  |-  F/ x  B  Fn  On
2 nfra1 2372 . . . 4  |-  F/ x A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) )
31, 2nfan 1473 . . 3  |-  F/ x
( B  Fn  On  /\ 
A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )
4 nfv 1437 . . . . . 6  |-  F/ x
( B `  y
)  =  ( F `
 y )
53, 4nfim 1480 . . . . 5  |-  F/ x
( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  y )  =  ( F `  y ) )
6 fveq2 5206 . . . . . . 7  |-  ( x  =  y  ->  ( B `  x )  =  ( B `  y ) )
7 fveq2 5206 . . . . . . 7  |-  ( x  =  y  ->  ( F `  x )  =  ( F `  y ) )
86, 7eqeq12d 2070 . . . . . 6  |-  ( x  =  y  ->  (
( B `  x
)  =  ( F `
 x )  <->  ( B `  y )  =  ( F `  y ) ) )
98imbi2d 223 . . . . 5  |-  ( x  =  y  ->  (
( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  x )  =  ( F `  x ) )  <->  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  y )  =  ( F `  y ) ) ) )
10 r19.21v 2413 . . . . . 6  |-  ( A. y  e.  x  (
( B  Fn  On  /\ 
A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  y )  =  ( F `  y ) )  <->  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  A. y  e.  x  ( B `  y )  =  ( F `  y ) ) )
11 rsp 2386 . . . . . . . . . 10  |-  ( A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) )  ->  ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) ) )
12 onss 4247 . . . . . . . . . . . . . . . . . . 19  |-  ( x  e.  On  ->  x  C_  On )
13 tfri3.1 . . . . . . . . . . . . . . . . . . . . . 22  |-  F  = recs ( G )
14 tfri3.2 . . . . . . . . . . . . . . . . . . . . . 22  |-  ( Fun 
G  /\  ( G `  x )  e.  _V )
1513, 14tfri1 5982 . . . . . . . . . . . . . . . . . . . . 21  |-  F  Fn  On
16 fvreseq 5299 . . . . . . . . . . . . . . . . . . . . 21  |-  ( ( ( B  Fn  On  /\  F  Fn  On )  /\  x  C_  On )  ->  ( ( B  |`  x )  =  ( F  |`  x )  <->  A. y  e.  x  ( B `  y )  =  ( F `  y ) ) )
1715, 16mpanl2 419 . . . . . . . . . . . . . . . . . . . 20  |-  ( ( B  Fn  On  /\  x  C_  On )  -> 
( ( B  |`  x )  =  ( F  |`  x )  <->  A. y  e.  x  ( B `  y )  =  ( F `  y ) ) )
18 fveq2 5206 . . . . . . . . . . . . . . . . . . . 20  |-  ( ( B  |`  x )  =  ( F  |`  x )  ->  ( G `  ( B  |`  x ) )  =  ( G `  ( F  |`  x ) ) )
1917, 18syl6bir 157 . . . . . . . . . . . . . . . . . . 19  |-  ( ( B  Fn  On  /\  x  C_  On )  -> 
( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( G `  ( B  |`  x ) )  =  ( G `
 ( F  |`  x ) ) ) )
2012, 19sylan2 274 . . . . . . . . . . . . . . . . . 18  |-  ( ( B  Fn  On  /\  x  e.  On )  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( G `  ( B  |`  x ) )  =  ( G `
 ( F  |`  x ) ) ) )
2120ancoms 259 . . . . . . . . . . . . . . . . 17  |-  ( ( x  e.  On  /\  B  Fn  On )  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( G `  ( B  |`  x ) )  =  ( G `
 ( F  |`  x ) ) ) )
2221imp 119 . . . . . . . . . . . . . . . 16  |-  ( ( ( x  e.  On  /\  B  Fn  On )  /\  A. y  e.  x  ( B `  y )  =  ( F `  y ) )  ->  ( G `  ( B  |`  x
) )  =  ( G `  ( F  |`  x ) ) )
2322adantr 265 . . . . . . . . . . . . . . 15  |-  ( ( ( ( x  e.  On  /\  B  Fn  On )  /\  A. y  e.  x  ( B `  y )  =  ( F `  y ) )  /\  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  /\  x  e.  On ) )  -> 
( G `  ( B  |`  x ) )  =  ( G `  ( F  |`  x ) ) )
2413, 14tfri2 5983 . . . . . . . . . . . . . . . . . . . 20  |-  ( x  e.  On  ->  ( F `  x )  =  ( G `  ( F  |`  x ) ) )
2524jctr 302 . . . . . . . . . . . . . . . . . . 19  |-  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
( x  e.  On  ->  ( B `  x
)  =  ( G `
 ( B  |`  x ) ) )  /\  ( x  e.  On  ->  ( F `  x )  =  ( G `  ( F  |`  x ) ) ) ) )
26 jcab 545 . . . . . . . . . . . . . . . . . . 19  |-  ( ( x  e.  On  ->  ( ( B `  x
)  =  ( G `
 ( B  |`  x ) )  /\  ( F `  x )  =  ( G `  ( F  |`  x ) ) ) )  <->  ( (
x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  /\  (
x  e.  On  ->  ( F `  x )  =  ( G `  ( F  |`  x ) ) ) ) )
2725, 26sylibr 141 . . . . . . . . . . . . . . . . . 18  |-  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( ( B `  x
)  =  ( G `
 ( B  |`  x ) )  /\  ( F `  x )  =  ( G `  ( F  |`  x ) ) ) ) )
28 eqeq12 2068 . . . . . . . . . . . . . . . . . 18  |-  ( ( ( B `  x
)  =  ( G `
 ( B  |`  x ) )  /\  ( F `  x )  =  ( G `  ( F  |`  x ) ) )  ->  (
( B `  x
)  =  ( F `
 x )  <->  ( G `  ( B  |`  x
) )  =  ( G `  ( F  |`  x ) ) ) )
2927, 28syl6 33 . . . . . . . . . . . . . . . . 17  |-  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( ( B `  x
)  =  ( F `
 x )  <->  ( G `  ( B  |`  x
) )  =  ( G `  ( F  |`  x ) ) ) ) )
3029imp 119 . . . . . . . . . . . . . . . 16  |-  ( ( ( x  e.  On  ->  ( B `  x
)  =  ( G `
 ( B  |`  x ) ) )  /\  x  e.  On )  ->  ( ( B `
 x )  =  ( F `  x
)  <->  ( G `  ( B  |`  x ) )  =  ( G `
 ( F  |`  x ) ) ) )
3130adantl 266 . . . . . . . . . . . . . . 15  |-  ( ( ( ( x  e.  On  /\  B  Fn  On )  /\  A. y  e.  x  ( B `  y )  =  ( F `  y ) )  /\  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  /\  x  e.  On ) )  -> 
( ( B `  x )  =  ( F `  x )  <-> 
( G `  ( B  |`  x ) )  =  ( G `  ( F  |`  x ) ) ) )
3223, 31mpbird 160 . . . . . . . . . . . . . 14  |-  ( ( ( ( x  e.  On  /\  B  Fn  On )  /\  A. y  e.  x  ( B `  y )  =  ( F `  y ) )  /\  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  /\  x  e.  On ) )  -> 
( B `  x
)  =  ( F `
 x ) )
3332exp43 358 . . . . . . . . . . . . 13  |-  ( ( x  e.  On  /\  B  Fn  On )  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( B `  x )  =  ( F `  x ) ) ) ) )
3433com4t 83 . . . . . . . . . . . 12  |-  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( ( x  e.  On  /\  B  Fn  On )  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( B `  x )  =  ( F `  x ) ) ) ) )
3534exp4a 352 . . . . . . . . . . 11  |-  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( x  e.  On  ->  ( B  Fn  On  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( B `  x )  =  ( F `  x ) ) ) ) ) )
3635pm2.43d 48 . . . . . . . . . 10  |-  ( ( x  e.  On  ->  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( B  Fn  On  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( B `  x )  =  ( F `  x ) ) ) ) )
3711, 36syl 14 . . . . . . . . 9  |-  ( A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) )  ->  ( x  e.  On  ->  ( B  Fn  On  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( B `  x )  =  ( F `  x ) ) ) ) )
3837com3l 79 . . . . . . . 8  |-  ( x  e.  On  ->  ( B  Fn  On  ->  ( A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) )  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( B `  x )  =  ( F `  x ) ) ) ) )
3938impd 246 . . . . . . 7  |-  ( x  e.  On  ->  (
( B  Fn  On  /\ 
A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( A. y  e.  x  ( B `  y )  =  ( F `  y )  ->  ( B `  x )  =  ( F `  x ) ) ) )
4039a2d 26 . . . . . 6  |-  ( x  e.  On  ->  (
( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  A. y  e.  x  ( B `  y )  =  ( F `  y ) )  -> 
( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  x )  =  ( F `  x ) ) ) )
4110, 40syl5bi 145 . . . . 5  |-  ( x  e.  On  ->  ( A. y  e.  x  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  y )  =  ( F `  y ) )  ->  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  x )  =  ( F `  x ) ) ) )
425, 9, 41tfis2f 4335 . . . 4  |-  ( x  e.  On  ->  (
( B  Fn  On  /\ 
A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  ( B `  x )  =  ( F `  x ) ) )
4342com12 30 . . 3  |-  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  (
x  e.  On  ->  ( B `  x )  =  ( F `  x ) ) )
443, 43ralrimi 2407 . 2  |-  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  A. x  e.  On  ( B `  x )  =  ( F `  x ) )
45 eqfnfv 5293 . . . 4  |-  ( ( B  Fn  On  /\  F  Fn  On )  ->  ( B  =  F  <->  A. x  e.  On  ( B `  x )  =  ( F `  x ) ) )
4615, 45mpan2 409 . . 3  |-  ( B  Fn  On  ->  ( B  =  F  <->  A. x  e.  On  ( B `  x )  =  ( F `  x ) ) )
4746biimpar 285 . 2  |-  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( F `  x ) )  ->  B  =  F )
4844, 47syldan 270 1  |-  ( ( B  Fn  On  /\  A. x  e.  On  ( B `  x )  =  ( G `  ( B  |`  x ) ) )  ->  B  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    <-> wb 102    = wceq 1259    e. wcel 1409   A.wral 2323   _Vcvv 2574    C_ wss 2945   Oncon0 4128    |` cres 4375   Fun wfun 4924    Fn wfn 4925   ` cfv 4930  recscrecs 5950
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3900  ax-sep 3903  ax-pow 3955  ax-pr 3972  ax-un 4198  ax-setind 4290
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2788  df-csb 2881  df-dif 2948  df-un 2950  df-in 2952  df-ss 2959  df-nul 3253  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-iun 3687  df-br 3793  df-opab 3847  df-mpt 3848  df-tr 3883  df-id 4058  df-iord 4131  df-on 4133  df-suc 4136  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-rn 4384  df-res 4385  df-ima 4386  df-iota 4895  df-fun 4932  df-fn 4933  df-f 4934  df-f1 4935  df-fo 4936  df-f1o 4937  df-fv 4938  df-recs 5951
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator