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

Theorem algfx 12855
Description: If  F reaches a fixed point when the countdown function  C reaches  0,  F remains fixed after  N steps. (Contributed by Paul Chapman, 22-Jun-2011.)
Hypotheses
Ref Expression
algcvga.1  |-  F : S
--> S
algcvga.2  |-  R  =  seq 0 ( ( F  o.  1st ) ,  ( NN0  X.  { A } ) )
algcvga.3  |-  C : S
--> NN0
algcvga.4  |-  ( z  e.  S  ->  (
( C `  ( F `  z )
)  =/=  0  -> 
( C `  ( F `  z )
)  <  ( C `  z ) ) )
algcvga.5  |-  N  =  ( C `  A
)
algfx.6  |-  ( z  e.  S  ->  (
( C `  z
)  =  0  -> 
( F `  z
)  =  z ) )
Assertion
Ref Expression
algfx  |-  ( A  e.  S  ->  ( K  e.  ( ZZ>= `  N )  ->  ( R `  K )  =  ( R `  N ) ) )
Distinct variable groups:    z, C    z, F    z, R    z, S    z, K    z, N
Allowed substitution hint:    A( z)

Proof of Theorem algfx
Dummy variables  k  m are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 algcvga.5 . . . 4  |-  N  =  ( C `  A
)
2 algcvga.3 . . . . 5  |-  C : S
--> NN0
32ffvelcdmi 5845 . . . 4  |-  ( A  e.  S  ->  ( C `  A )  e.  NN0 )
41, 3eqeltrid 2325 . . 3  |-  ( A  e.  S  ->  N  e.  NN0 )
54nn0zd 9777 . 2  |-  ( A  e.  S  ->  N  e.  ZZ )
6 uzval 9939 . . . . . . 7  |-  ( N  e.  ZZ  ->  ( ZZ>=
`  N )  =  { z  e.  ZZ  |  N  <_  z } )
76eleq2d 2308 . . . . . 6  |-  ( N  e.  ZZ  ->  ( K  e.  ( ZZ>= `  N )  <->  K  e.  { z  e.  ZZ  |  N  <_  z } ) )
87pm5.32i 458 . . . . 5  |-  ( ( N  e.  ZZ  /\  K  e.  ( ZZ>= `  N ) )  <->  ( N  e.  ZZ  /\  K  e. 
{ z  e.  ZZ  |  N  <_  z } ) )
9 fveqeq2 5707 . . . . . . 7  |-  ( m  =  N  ->  (
( R `  m
)  =  ( R `
 N )  <->  ( R `  N )  =  ( R `  N ) ) )
109imbi2d 230 . . . . . 6  |-  ( m  =  N  ->  (
( A  e.  S  ->  ( R `  m
)  =  ( R `
 N ) )  <-> 
( A  e.  S  ->  ( R `  N
)  =  ( R `
 N ) ) ) )
11 fveqeq2 5707 . . . . . . 7  |-  ( m  =  k  ->  (
( R `  m
)  =  ( R `
 N )  <->  ( R `  k )  =  ( R `  N ) ) )
1211imbi2d 230 . . . . . 6  |-  ( m  =  k  ->  (
( A  e.  S  ->  ( R `  m
)  =  ( R `
 N ) )  <-> 
( A  e.  S  ->  ( R `  k
)  =  ( R `
 N ) ) ) )
13 fveqeq2 5707 . . . . . . 7  |-  ( m  =  ( k  +  1 )  ->  (
( R `  m
)  =  ( R `
 N )  <->  ( R `  ( k  +  1 ) )  =  ( R `  N ) ) )
1413imbi2d 230 . . . . . 6  |-  ( m  =  ( k  +  1 )  ->  (
( A  e.  S  ->  ( R `  m
)  =  ( R `
 N ) )  <-> 
( A  e.  S  ->  ( R `  (
k  +  1 ) )  =  ( R `
 N ) ) ) )
15 fveqeq2 5707 . . . . . . 7  |-  ( m  =  K  ->  (
( R `  m
)  =  ( R `
 N )  <->  ( R `  K )  =  ( R `  N ) ) )
1615imbi2d 230 . . . . . 6  |-  ( m  =  K  ->  (
( A  e.  S  ->  ( R `  m
)  =  ( R `
 N ) )  <-> 
( A  e.  S  ->  ( R `  K
)  =  ( R `
 N ) ) ) )
17 eqidd 2239 . . . . . . 7  |-  ( A  e.  S  ->  ( R `  N )  =  ( R `  N ) )
1817a1i 9 . . . . . 6  |-  ( N  e.  ZZ  ->  ( A  e.  S  ->  ( R `  N )  =  ( R `  N ) ) )
196eleq2d 2308 . . . . . . . . 9  |-  ( N  e.  ZZ  ->  (
k  e.  ( ZZ>= `  N )  <->  k  e.  { z  e.  ZZ  |  N  <_  z } ) )
2019pm5.32i 458 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  k  e.  ( ZZ>= `  N ) )  <->  ( N  e.  ZZ  /\  k  e. 
{ z  e.  ZZ  |  N  <_  z } ) )
21 eluznn0 10015 . . . . . . . . . . . . . . 15  |-  ( ( N  e.  NN0  /\  k  e.  ( ZZ>= `  N ) )  -> 
k  e.  NN0 )
224, 21sylan 283 . . . . . . . . . . . . . 14  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
k  e.  NN0 )
23 nn0uz 9973 . . . . . . . . . . . . . . 15  |-  NN0  =  ( ZZ>= `  0 )
24 algcvga.2 . . . . . . . . . . . . . . 15  |-  R  =  seq 0 ( ( F  o.  1st ) ,  ( NN0  X.  { A } ) )
25 0zd 9667 . . . . . . . . . . . . . . 15  |-  ( A  e.  S  ->  0  e.  ZZ )
26 id 19 . . . . . . . . . . . . . . 15  |-  ( A  e.  S  ->  A  e.  S )
27 algcvga.1 . . . . . . . . . . . . . . . 16  |-  F : S
--> S
2827a1i 9 . . . . . . . . . . . . . . 15  |-  ( A  e.  S  ->  F : S --> S )
2923, 24, 25, 26, 28algrp1 12849 . . . . . . . . . . . . . 14  |-  ( ( A  e.  S  /\  k  e.  NN0 )  -> 
( R `  (
k  +  1 ) )  =  ( F `
 ( R `  k ) ) )
3022, 29syldan 282 . . . . . . . . . . . . 13  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( R `  (
k  +  1 ) )  =  ( F `
 ( R `  k ) ) )
3123, 24, 25, 26, 28algrf 12848 . . . . . . . . . . . . . . . 16  |-  ( A  e.  S  ->  R : NN0 --> S )
3231ffvelcdmda 5846 . . . . . . . . . . . . . . 15  |-  ( ( A  e.  S  /\  k  e.  NN0 )  -> 
( R `  k
)  e.  S )
3322, 32syldan 282 . . . . . . . . . . . . . 14  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( R `  k
)  e.  S )
34 algcvga.4 . . . . . . . . . . . . . . . 16  |-  ( z  e.  S  ->  (
( C `  ( F `  z )
)  =/=  0  -> 
( C `  ( F `  z )
)  <  ( C `  z ) ) )
3527, 24, 2, 34, 1algcvga 12854 . . . . . . . . . . . . . . 15  |-  ( A  e.  S  ->  (
k  e.  ( ZZ>= `  N )  ->  ( C `  ( R `  k ) )  =  0 ) )
3635imp 124 . . . . . . . . . . . . . 14  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( C `  ( R `  k )
)  =  0 )
37 fveqeq2 5707 . . . . . . . . . . . . . . . 16  |-  ( z  =  ( R `  k )  ->  (
( C `  z
)  =  0  <->  ( C `  ( R `  k ) )  =  0 ) )
38 fveq2 5698 . . . . . . . . . . . . . . . . 17  |-  ( z  =  ( R `  k )  ->  ( F `  z )  =  ( F `  ( R `  k ) ) )
39 id 19 . . . . . . . . . . . . . . . . 17  |-  ( z  =  ( R `  k )  ->  z  =  ( R `  k ) )
4038, 39eqeq12d 2253 . . . . . . . . . . . . . . . 16  |-  ( z  =  ( R `  k )  ->  (
( F `  z
)  =  z  <->  ( F `  ( R `  k
) )  =  ( R `  k ) ) )
4137, 40imbi12d 234 . . . . . . . . . . . . . . 15  |-  ( z  =  ( R `  k )  ->  (
( ( C `  z )  =  0  ->  ( F `  z )  =  z )  <->  ( ( C `
 ( R `  k ) )  =  0  ->  ( F `  ( R `  k
) )  =  ( R `  k ) ) ) )
42 algfx.6 . . . . . . . . . . . . . . 15  |-  ( z  e.  S  ->  (
( C `  z
)  =  0  -> 
( F `  z
)  =  z ) )
4341, 42vtoclga 2889 . . . . . . . . . . . . . 14  |-  ( ( R `  k )  e.  S  ->  (
( C `  ( R `  k )
)  =  0  -> 
( F `  ( R `  k )
)  =  ( R `
 k ) ) )
4433, 36, 43sylc 62 . . . . . . . . . . . . 13  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( F `  ( R `  k )
)  =  ( R `
 k ) )
4530, 44eqtrd 2271 . . . . . . . . . . . 12  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( R `  (
k  +  1 ) )  =  ( R `
 k ) )
4645eqeq1d 2247 . . . . . . . . . . 11  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( ( R `  ( k  +  1 ) )  =  ( R `  N )  <-> 
( R `  k
)  =  ( R `
 N ) ) )
4746biimprd 158 . . . . . . . . . 10  |-  ( ( A  e.  S  /\  k  e.  ( ZZ>= `  N ) )  -> 
( ( R `  k )  =  ( R `  N )  ->  ( R `  ( k  +  1 ) )  =  ( R `  N ) ) )
4847expcom 116 . . . . . . . . 9  |-  ( k  e.  ( ZZ>= `  N
)  ->  ( A  e.  S  ->  ( ( R `  k )  =  ( R `  N )  ->  ( R `  ( k  +  1 ) )  =  ( R `  N ) ) ) )
4948adantl 277 . . . . . . . 8  |-  ( ( N  e.  ZZ  /\  k  e.  ( ZZ>= `  N ) )  -> 
( A  e.  S  ->  ( ( R `  k )  =  ( R `  N )  ->  ( R `  ( k  +  1 ) )  =  ( R `  N ) ) ) )
5020, 49sylbir 135 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  k  e.  { z  e.  ZZ  |  N  <_ 
z } )  -> 
( A  e.  S  ->  ( ( R `  k )  =  ( R `  N )  ->  ( R `  ( k  +  1 ) )  =  ( R `  N ) ) ) )
5150a2d 26 . . . . . 6  |-  ( ( N  e.  ZZ  /\  k  e.  { z  e.  ZZ  |  N  <_ 
z } )  -> 
( ( A  e.  S  ->  ( R `  k )  =  ( R `  N ) )  ->  ( A  e.  S  ->  ( R `
 ( k  +  1 ) )  =  ( R `  N
) ) ) )
5210, 12, 14, 16, 18, 51uzind3 9770 . . . . 5  |-  ( ( N  e.  ZZ  /\  K  e.  { z  e.  ZZ  |  N  <_ 
z } )  -> 
( A  e.  S  ->  ( R `  K
)  =  ( R `
 N ) ) )
538, 52sylbi 121 . . . 4  |-  ( ( N  e.  ZZ  /\  K  e.  ( ZZ>= `  N ) )  -> 
( A  e.  S  ->  ( R `  K
)  =  ( R `
 N ) ) )
5453ex 115 . . 3  |-  ( N  e.  ZZ  ->  ( K  e.  ( ZZ>= `  N )  ->  ( A  e.  S  ->  ( R `  K )  =  ( R `  N ) ) ) )
5554com3r 79 . 2  |-  ( A  e.  S  ->  ( N  e.  ZZ  ->  ( K  e.  ( ZZ>= `  N )  ->  ( R `  K )  =  ( R `  N ) ) ) )
565, 55mpd 13 1  |-  ( A  e.  S  ->  ( K  e.  ( ZZ>= `  N )  ->  ( R `  K )  =  ( R `  N ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    =/= wne 2420   {crab 2532   {csn 3709   class class class wbr 4131    X. cxp 4774    o. ccom 4780   -->wf 5376   ` cfv 5380  (class class class)co 6088   1stc1st 6376   0cc0 8185   1c1 8186    + caddc 8188    < clt 8366    <_ cle 8367   NN0cn0 9574   ZZcz 9655   ZZ>=cuz 9937    seqcseq 10905
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-seqfrec 10906
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator