MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  abianfplem Unicode version

Theorem abianfplem 6438
Description: Lemma for abianfp 6439. We prove by transfinite induction that if  F has a fixed point  x, then its iterates also equal  x. This lemma is used for the "trivial" direction of the main theorem. (Contributed by NM, 4-Sep-2004.)
Hypotheses
Ref Expression
abianfp.1  |-  A  e. 
_V
abianfp.2  |-  G  =  rec ( ( z  e.  _V  |->  ( F `
 z ) ) ,  x )
Assertion
Ref Expression
abianfplem  |-  ( v  e.  On  ->  (
( F `  x
)  =  x  -> 
( G `  v
)  =  x ) )
Distinct variable groups:    x, v    z, v, F    v, G
Allowed substitution hints:    A( x, z, v)    F( x)    G( x, z)

Proof of Theorem abianfplem
StepHypRef Expression
1 fveq2 5458 . . 3  |-  ( v  =  (/)  ->  ( G `
 v )  =  ( G `  (/) ) )
21eqeq1d 2266 . 2  |-  ( v  =  (/)  ->  ( ( G `  v )  =  x  <->  ( G `  (/) )  =  x ) )
3 fveq2 5458 . . 3  |-  ( v  =  y  ->  ( G `  v )  =  ( G `  y ) )
43eqeq1d 2266 . 2  |-  ( v  =  y  ->  (
( G `  v
)  =  x  <->  ( G `  y )  =  x ) )
5 fveq2 5458 . . 3  |-  ( v  =  suc  y  -> 
( G `  v
)  =  ( G `
 suc  y )
)
65eqeq1d 2266 . 2  |-  ( v  =  suc  y  -> 
( ( G `  v )  =  x  <-> 
( G `  suc  y )  =  x ) )
7 abianfp.2 . . . . 5  |-  G  =  rec ( ( z  e.  _V  |->  ( F `
 z ) ) ,  x )
87fveq1i 5459 . . . 4  |-  ( G `
 (/) )  =  ( rec ( ( z  e.  _V  |->  ( F `
 z ) ) ,  x ) `  (/) )
9 vex 2766 . . . . 5  |-  x  e. 
_V
109rdg0 6402 . . . 4  |-  ( rec ( ( z  e. 
_V  |->  ( F `  z ) ) ,  x ) `  (/) )  =  x
118, 10eqtri 2278 . . 3  |-  ( G `
 (/) )  =  x
1211a1i 12 . 2  |-  ( ( F `  x )  =  x  ->  ( G `  (/) )  =  x )
13 fvex 5472 . . . . 5  |-  ( F `
 ( G `  y ) )  e. 
_V
14 fveq2 5458 . . . . . 6  |-  ( v  =  z  ->  ( F `  v )  =  ( F `  z ) )
15 fveq2 5458 . . . . . 6  |-  ( v  =  ( G `  y )  ->  ( F `  v )  =  ( F `  ( G `  y ) ) )
167, 14, 15rdgsucmpt2 6411 . . . . 5  |-  ( ( y  e.  On  /\  ( F `  ( G `
 y ) )  e.  _V )  -> 
( G `  suc  y )  =  ( F `  ( G `
 y ) ) )
1713, 16mpan2 655 . . . 4  |-  ( y  e.  On  ->  ( G `  suc  y )  =  ( F `  ( G `  y ) ) )
18 fveq2 5458 . . . . 5  |-  ( ( G `  y )  =  x  ->  ( F `  ( G `  y ) )  =  ( F `  x
) )
19 id 21 . . . . 5  |-  ( ( F `  x )  =  x  ->  ( F `  x )  =  x )
2018, 19sylan9eqr 2312 . . . 4  |-  ( ( ( F `  x
)  =  x  /\  ( G `  y )  =  x )  -> 
( F `  ( G `  y )
)  =  x )
2117, 20sylan9eq 2310 . . 3  |-  ( ( y  e.  On  /\  ( ( F `  x )  =  x  /\  ( G `  y )  =  x ) )  ->  ( G `  suc  y )  =  x )
2221exp32 591 . 2  |-  ( y  e.  On  ->  (
( F `  x
)  =  x  -> 
( ( G `  y )  =  x  ->  ( G `  suc  y )  =  x ) ) )
23 vex 2766 . . . . . . . 8  |-  v  e. 
_V
24 rdglim2a 6414 . . . . . . . 8  |-  ( ( v  e.  _V  /\  Lim  v )  ->  ( rec ( ( z  e. 
_V  |->  ( F `  z ) ) ,  x ) `  v
)  =  U_ y  e.  v  ( rec ( ( z  e. 
_V  |->  ( F `  z ) ) ,  x ) `  y
) )
2523, 24mpan 654 . . . . . . 7  |-  ( Lim  v  ->  ( rec ( ( z  e. 
_V  |->  ( F `  z ) ) ,  x ) `  v
)  =  U_ y  e.  v  ( rec ( ( z  e. 
_V  |->  ( F `  z ) ) ,  x ) `  y
) )
267fveq1i 5459 . . . . . . 7  |-  ( G `
 v )  =  ( rec ( ( z  e.  _V  |->  ( F `  z ) ) ,  x ) `
 v )
277fveq1i 5459 . . . . . . . . 9  |-  ( G `
 y )  =  ( rec ( ( z  e.  _V  |->  ( F `  z ) ) ,  x ) `
 y )
2827a1i 12 . . . . . . . 8  |-  ( y  e.  v  ->  ( G `  y )  =  ( rec (
( z  e.  _V  |->  ( F `  z ) ) ,  x ) `
 y ) )
2928iuneq2i 3897 . . . . . . 7  |-  U_ y  e.  v  ( G `  y )  =  U_ y  e.  v  ( rec ( ( z  e. 
_V  |->  ( F `  z ) ) ,  x ) `  y
)
3025, 26, 293eqtr4g 2315 . . . . . 6  |-  ( Lim  v  ->  ( G `  v )  =  U_ y  e.  v  ( G `  y )
)
3130adantr 453 . . . . 5  |-  ( ( Lim  v  /\  A. y  e.  v  ( G `  y )  =  x )  ->  ( G `  v )  =  U_ y  e.  v  ( G `  y
) )
32 iuneq2 3895 . . . . . 6  |-  ( A. y  e.  v  ( G `  y )  =  x  ->  U_ y  e.  v  ( G `  y )  =  U_ y  e.  v  x
)
33 df-lim 4369 . . . . . . . 8  |-  ( Lim  v  <->  ( Ord  v  /\  v  =/=  (/)  /\  v  =  U. v ) )
3433simp2bi 976 . . . . . . 7  |-  ( Lim  v  ->  v  =/=  (/) )
35 iunconst 3887 . . . . . . 7  |-  ( v  =/=  (/)  ->  U_ y  e.  v  x  =  x )
3634, 35syl 17 . . . . . 6  |-  ( Lim  v  ->  U_ y  e.  v  x  =  x )
3732, 36sylan9eqr 2312 . . . . 5  |-  ( ( Lim  v  /\  A. y  e.  v  ( G `  y )  =  x )  ->  U_ y  e.  v  ( G `  y )  =  x )
3831, 37eqtrd 2290 . . . 4  |-  ( ( Lim  v  /\  A. y  e.  v  ( G `  y )  =  x )  ->  ( G `  v )  =  x )
3938ex 425 . . 3  |-  ( Lim  v  ->  ( A. y  e.  v  ( G `  y )  =  x  ->  ( G `
 v )  =  x ) )
4039a1d 24 . 2  |-  ( Lim  v  ->  ( ( F `  x )  =  x  ->  ( A. y  e.  v  ( G `  y )  =  x  ->  ( G `
 v )  =  x ) ) )
412, 4, 6, 12, 22, 40tfinds2 4626 1  |-  ( v  e.  On  ->  (
( F `  x
)  =  x  -> 
( G `  v
)  =  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    /\ wa 360    = wceq 1619    e. wcel 1621    =/= wne 2421   A.wral 2518   _Vcvv 2763   (/)c0 3430   U.cuni 3801   U_ciun 3879    e. cmpt 4051   Ord word 4363   Oncon0 4364   Lim wlim 4365   suc csuc 4366   ` cfv 4673   reccrdg 6390
This theorem is referenced by:  abianfp  6439
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2239  ax-rep 4105  ax-sep 4115  ax-nul 4123  ax-pr 4186  ax-un 4484
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2122  df-mo 2123  df-clab 2245  df-cleq 2251  df-clel 2254  df-nfc 2383  df-ne 2423  df-ral 2523  df-rex 2524  df-reu 2525  df-rab 2527  df-v 2765  df-sbc 2967  df-csb 3057  df-dif 3130  df-un 3132  df-in 3134  df-ss 3141  df-pss 3143  df-nul 3431  df-if 3540  df-pw 3601  df-sn 3620  df-pr 3621  df-tp 3622  df-op 3623  df-uni 3802  df-iun 3881  df-br 3998  df-opab 4052  df-mpt 4053  df-tr 4088  df-eprel 4277  df-id 4281  df-po 4286  df-so 4287  df-fr 4324  df-we 4326  df-ord 4367  df-on 4368  df-lim 4369  df-suc 4370  df-om 4629  df-xp 4675  df-rel 4676  df-cnv 4677  df-co 4678  df-dm 4679  df-rn 4680  df-res 4681  df-ima 4682  df-fun 4683  df-fn 4684  df-f 4685  df-f1 4686  df-fo 4687  df-f1o 4688  df-fv 4689  df-recs 6356  df-rdg 6391
  Copyright terms: Public domain W3C validator