Theorem alginv 12850

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 5703	. . . . 5 |- ( z = 0 -> ( I ` ( R ` z ) ) = ( I ` ( R ` 0 ) ) )
2	1	eqeq1d 2247	. . . 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 5703	. . . . 5 |- ( z = k -> ( I ` ( R ` z ) ) = ( I ` ( R ` k ) ) )
5	4	eqeq1d 2247	. . . 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 5703	. . . . 5 |- ( z = ( k + 1 ) -> ( I ` ( R ` z ) ) = ( I ` ( R ` ( k + 1 ) ) ) )
8	7	eqeq1d 2247	. . . 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 5703	. . . . 5 |- ( z = K -> ( I ` ( R ` z ) ) = ( I ` ( R ` K ) ) )
11	10	eqeq1d 2247	. . . 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 2239	. . 3 |- ( A e. S -> ( I ` ( R ` 0 ) ) = ( I ` ( R ` 0 ) ) )
14		nn0uz 9973	. . . . . . . . . 10 |- NN0 = ( ZZ>= ` 0 )
15		alginv.1	. . . . . . . . . 10 |- R = seq 0 ( ( F o. 1st ) , ( NN0 X. { A } ) )
16		0zd 9667	. . . . . . . . . 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 12849	. . . . . . . . 9 |- ( ( A e. S /\ k e. NN0 ) -> ( R ` ( k + 1 ) ) = ( F ` ( R ` k ) ) )
21	20	fveq2d 5702	. . . . . . . 8 |- ( ( A e. S /\ k e. NN0 ) -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( F ` ( R ` k ) ) ) )
22	14, 15, 16, 17, 19	algrf 12848	. . . . . . . . . 10 |- ( A e. S -> R : NN0 --> S )
23	22	ffvelcdmda 5846	. . . . . . . . 9 |- ( ( A e. S /\ k e. NN0 ) -> ( R ` k ) e. S )
24		2fveq3 5703	. . . . . . . . . . 11 |- ( x = ( R ` k ) -> ( I ` ( F ` x ) ) = ( I ` ( F ` ( R ` k ) ) ) )
25		fveq2 5698	. . . . . . . . . . 11 |- ( x = ( R ` k ) -> ( I ` x ) = ( I ` ( R ` k ) ) )
26	24, 25	eqeq12d 2253	. . . . . . . . . 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 2889	. . . . . . . . 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 2271	. . . . . . 7 |- ( ( A e. S /\ k e. NN0 ) -> ( I ` ( R ` ( k + 1 ) ) ) = ( I ` ( R ` k ) ) )
31	30	eqeq1d 2247	. . . . . 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 9771	. 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 ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   {csn 3709   X. cxp 4774   o. ccom 4780   -->wf 5376   ` cfv 5380  (class class class)co 6088   1stc1st 6376   0cc0 8185   1c1 8186   + caddc 8188   NN0cn0 9574   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-ltadd 8301

This proof depends on definitions:  df-bi 117  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:  eucalg  12862