Theorem alginv 12569

Description: If I is an invariant of F, then its value is unchanged after any number of iterations of F. (Contributed by Paul Chapman, 31-Mar-2011.)

Hypotheses

Ref	Expression
alginv.1	|- R = seq 0 ( ( F o. 1st ) , ( NN0 X. { A } ) )
alginv.2	|- F : S --> S
alginv.3	|- ( x e. S -> ( I ` ( F ` x ) ) = ( I ` x ) )

Assertion

Ref	Expression
alginv	|- ( ( A e. S /\ K e. NN0 ) -> ( I ` ( R ` K ) ) = ( I ` ( R ` 0 ) ) )

Distinct variable groups:   x, F   x, I   x, R   x, S

Allowed substitution hints:   A( x)   K( x)

Proof of Theorem alginv

Dummy variables z k are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		2fveq3 5632	. . . . 5 |- ( z = 0 -> ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) )
2	1	eqeq1d 2238	. . . 4 |- ( z = 0 -> ( ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) <-> ( I ` ( R ` 0 ) ) = ( I ` ( R ` 0 ) ) ) )
3	2	imbi2d 230	. . 3 |- ( z = 0 -> ( ( A e. S -> ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) ) <-> ( A e. S -> ( I ` ( R ` 0 ) ) = ( I ` ( R ` 0 ) ) ) ) )
4		2fveq3 5632	. . . . 5 |- ( z = k -> ( I ` ( R ` z ) ) = ( I ` ( R ` k ) ) )
5	4	eqeq1d 2238	. . . 4 |- ( z = k -> ( ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) <-> ( I ` ( R ` k ) ) = ( I ` ( R ` 0 ) ) ) )
6	5	imbi2d 230	. . 3 |- ( z = k -> ( ( A e. S -> ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) ) <-> ( A e. S -> ( I ` ( R ` k ) ) = ( I ` ( R ` 0 ) ) ) ) )
7		2fveq3 5632	. . . . 5 |- ( z = ( k + 1 ) -> ( I ` ( R ` z ) ) = ( I ` ( R ` ( k + 1 ) ) ) )
8	7	eqeq1d 2238	. . . 4 |- ( z = ( k + 1 ) -> ( ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) <-> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` 0 ) ) ) )
9	8	imbi2d 230	. . 3 |- ( z = ( k + 1 ) -> ( ( A e. S -> ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) ) <-> ( A e. S -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` 0 ) ) ) ) )
10		2fveq3 5632	. . . . 5 |- ( z = K -> ( I ` ( R ` z ) ) = ( I ` ( R ` K ) ) )
11	10	eqeq1d 2238	. . . 4 |- ( z = K -> ( ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) <-> ( I ` ( R ` K ) ) = ( I ` ( R ` 0 ) ) ) )
12	11	imbi2d 230	. . 3 |- ( z = K -> ( ( A e. S -> ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) ) <-> ( A e. S -> ( I ` ( R ` K ) ) = ( I ` ( R ` 0 ) ) ) ) )
13		eqidd 2230	. . 3 |- ( A e. S -> ( I ` ( R ` 0 ) ) = ( I ` ( R ` 0 ) ) )
14		nn0uz 9757	. . . . . . . . . 10 |- NN0 = ( ZZ>= ` 0 )
15		alginv.1	. . . . . . . . . 10 |- R = seq 0 ( ( F o. 1st ) , ( NN0 X. { A } ) )
16		0zd 9458	. . . . . . . . . 10 |- ( A e. S -> 0 e. ZZ )
17		id 19	. . . . . . . . . 10 |- ( A e. S -> A e. S )
18		alginv.2	. . . . . . . . . . 11 |- F : S --> S
19	18	a1i 9	. . . . . . . . . 10 |- ( A e. S -> F : S --> S )
20	14, 15, 16, 17, 19	algrp1 12568	. . . . . . . . 9 |- ( ( A e. S /\ k e. NN0 ) -> ( R ` ( k + 1 ) ) = ( F ` ( R ` k ) ) )
21	20	fveq2d 5631	. . . . . . . 8 |- ( ( A e. S /\ k e. NN0 ) -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( F ` ( R ` k ) ) ) )
22	14, 15, 16, 17, 19	algrf 12567	. . . . . . . . . 10 |- ( A e. S -> R : NN0 --> S )
23	22	ffvelcdmda 5770	. . . . . . . . 9 |- ( ( A e. S /\ k e. NN0 ) -> ( R ` k ) e. S )
24		2fveq3 5632	. . . . . . . . . . 11 |- ( x = ( R ` k ) -> ( I ` ( F ` x ) ) = ( I ` ( F ` ( R ` k ) ) ) )
25		fveq2 5627	. . . . . . . . . . 11 |- ( x = ( R ` k ) -> ( I ` x ) = ( I ` ( R ` k ) ) )
26	24, 25	eqeq12d 2244	. . . . . . . . . 10 |- ( x = ( R ` k ) -> ( ( I ` ( F ` x ) ) = ( I ` x ) <-> ( I ` ( F ` ( R ` k ) ) ) = ( I ` ( R ` k ) ) ) )
27		alginv.3	. . . . . . . . . 10 |- ( x e. S -> ( I ` ( F ` x ) ) = ( I ` x ) )
28	26, 27	vtoclga 2867	. . . . . . . . 9 |- ( ( R ` k ) e. S -> ( I ` ( F ` ( R ` k ) ) ) = ( I ` ( R ` k ) ) )
29	23, 28	syl 14	. . . . . . . 8 |- ( ( A e. S /\ k e. NN0 ) -> ( I ` ( F ` ( R ` k ) ) ) = ( I ` ( R ` k ) ) )
30	21, 29	eqtrd 2262	. . . . . . 7 |- ( ( A e. S /\ k e. NN0 ) -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` k ) ) )
31	30	eqeq1d 2238	. . . . . 6 |- ( ( A e. S /\ k e. NN0 ) -> ( ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` 0 ) ) <-> ( I ` ( R ` k ) ) = ( I ` ( R ` 0 ) ) ) )
32	31	biimprd 158	. . . . 5 |- ( ( A e. S /\ k e. NN0 ) -> ( ( I ` ( R ` k ) ) = ( I ` ( R ` 0 ) ) -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` 0 ) ) ) )
33	32	expcom 116	. . . 4 |- ( k e. NN0 -> ( A e. S -> ( ( I ` ( R ` k ) ) = ( I ` ( R ` 0 ) ) -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` 0 ) ) ) ) )
34	33	a2d 26	. . 3 |- ( k e. NN0 -> ( ( A e. S -> ( I ` ( R ` k ) ) = ( I ` ( R ` 0 ) ) ) -> ( A e. S -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` 0 ) ) ) ) )
35	3, 6, 9, 12, 13, 34	nn0ind 9561	. 2 |- ( K e. NN0 -> ( A e. S -> ( I ` ( R ` K ) ) = ( I ` ( R ` 0 ) ) ) )
36	35	impcom 125	1 |- ( ( A e. S /\ K e. NN0 ) -> ( I ` ( R ` K ) ) = ( I ` ( R ` 0 ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200   {csn 3666   X. cxp 4717   o. ccom 4723   -->wf 5314   ` cfv 5318  (class class class)co 6001   1stc1st 6284   0cc0 7999   1c1 8000   + caddc 8002   NN0cn0 9369   seqcseq 10669

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-ltadd 8115

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723  df-seqfrec 10670

This theorem is referenced by:  eucalg  12581