Theorem iseqf1olemfvp 10896

Description: Lemma for seq3f1o 10903. (Contributed by Jim Kingdon, 30-Aug-2022.)

Hypotheses

Ref	Expression
iseqf1olemfvp.k	|- ( ph -> K e. ( M ... N ) )
iseqf1olemfvp.t	|- ( ph -> T : ( M ... N ) -1-1-onto-> ( M ... N ) )
iseqf1olemfvp.a	|- ( ph -> A e. ( M ... N ) )
iseqf1olemfvp.g	|- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( G ` x ) e. S )
iseqf1olemfvp.p	|- P = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) )

Assertion

Ref	Expression
iseqf1olemfvp	|- ( ph -> ( [_ T / f ]_ P ` A ) = ( G ` ( T ` A ) ) )

Distinct variable groups:   x, A   f, G, x   x, K   f, M, x   f, N, x   x, S   T, f, x   ph, x

Allowed substitution hints:   ph( f)   A( f)   P( x, f)   S( f)   K( f)

Proof of Theorem iseqf1olemfvp

Step	Hyp	Ref	Expression
1		iseqf1olemfvp.p	. . . . 5 |- P = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) )
2	1	csbeq2i 3168	. . . 4 |- [_ T / f ]_ P = [_ T / f ]_ ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) )
3		iseqf1olemfvp.t	. . . . . . 7 |- ( ph -> T : ( M ... N ) -1-1-onto-> ( M ... N ) )
4		f1of 5619	. . . . . . 7 |- ( T : ( M ... N ) -1-1-onto-> ( M ... N ) -> T : ( M ... N ) --> ( M ... N ) )
5	3, 4	syl 14	. . . . . 6 |- ( ph -> T : ( M ... N ) --> ( M ... N ) )
6		iseqf1olemfvp.k	. . . . . . . 8 |- ( ph -> K e. ( M ... N ) )
7		elfzel1 10377	. . . . . . . 8 |- ( K e. ( M ... N ) -> M e. ZZ )
8	6, 7	syl 14	. . . . . . 7 |- ( ph -> M e. ZZ )
9		elfzel2 10376	. . . . . . . 8 |- ( K e. ( M ... N ) -> N e. ZZ )
10	6, 9	syl 14	. . . . . . 7 |- ( ph -> N e. ZZ )
11	8, 10	fzfigd 10817	. . . . . 6 |- ( ph -> ( M ... N ) e. Fin )
12		fex 5920	. . . . . 6 |- ( ( T : ( M ... N ) --> ( M ... N ) /\ ( M ... N ) e. Fin ) -> T e. _V )
13	5, 11, 12	syl2anc 411	. . . . 5 |- ( ph -> T e. _V )
14		nfcvd 2387	. . . . . 6 |- ( T e. _V -> F/_ f ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
15		fveq1 5674	. . . . . . . . 9 |- ( f = T -> ( f ` x ) = ( T ` x ) )
16	15	fveq2d 5679	. . . . . . . 8 |- ( f = T -> ( G ` ( f ` x ) ) = ( G ` ( T ` x ) ) )
17	16	ifeq1d 3644	. . . . . . 7 |- ( f = T -> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) = if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) )
18	17	mpteq2dv 4206	. . . . . 6 |- ( f = T -> ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) ) = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
19	14, 18	csbiegf 3185	. . . . 5 |- ( T e. _V -> [_ T / f ]_ ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) ) = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
20	13, 19	syl 14	. . . 4 |- ( ph -> [_ T / f ]_ ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) ) = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
21	2, 20	eqtrid 2279	. . 3 |- ( ph -> [_ T / f ]_ P = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
22		simpr 110	. . . . 5 |- ( ( ph /\ x = A ) -> x = A )
23	22	breq1d 4124	. . . 4 |- ( ( ph /\ x = A ) -> ( x <_ N <-> A <_ N ) )
24	22	fveq2d 5679	. . . . 5 |- ( ( ph /\ x = A ) -> ( T ` x ) = ( T ` A ) )
25	24	fveq2d 5679	. . . 4 |- ( ( ph /\ x = A ) -> ( G ` ( T ` x ) ) = ( G ` ( T ` A ) ) )
26	23, 25	ifbieq1d 3649	. . 3 |- ( ( ph /\ x = A ) -> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) = if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) )
27		iseqf1olemfvp.a	. . . 4 |- ( ph -> A e. ( M ... N ) )
28		elfzuz 10374	. . . 4 |- ( A e. ( M ... N ) -> A e. ( ZZ>= ` M ) )
29	27, 28	syl 14	. . 3 |- ( ph -> A e. ( ZZ>= ` M ) )
30		elfzle2 10382	. . . . . 6 |- ( A e. ( M ... N ) -> A <_ N )
31	27, 30	syl 14	. . . . 5 |- ( ph -> A <_ N )
32	31	iftrued 3633	. . . 4 |- ( ph -> if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) = ( G ` ( T ` A ) ) )
33		fveq2 5675	. . . . . 6 |- ( x = ( T ` A ) -> ( G ` x ) = ( G ` ( T ` A ) ) )
34	33	eleq1d 2303	. . . . 5 |- ( x = ( T ` A ) -> ( ( G ` x ) e. S <-> ( G ` ( T ` A ) ) e. S ) )
35		iseqf1olemfvp.g	. . . . . 6 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( G ` x ) e. S )
36	35	ralrimiva 2617	. . . . 5 |- ( ph -> A. x e. ( ZZ>= ` M ) ( G ` x ) e. S )
37	5, 27	ffvelcdmd 5818	. . . . . 6 |- ( ph -> ( T ` A ) e. ( M ... N ) )
38		elfzuz 10374	. . . . . 6 |- ( ( T ` A ) e. ( M ... N ) -> ( T ` A ) e. ( ZZ>= ` M ) )
39	37, 38	syl 14	. . . . 5 |- ( ph -> ( T ` A ) e. ( ZZ>= ` M ) )
40	34, 36, 39	rspcdva 2928	. . . 4 |- ( ph -> ( G ` ( T ` A ) ) e. S )
41	32, 40	eqeltrd 2311	. . 3 |- ( ph -> if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) e. S )
42	21, 26, 29, 41	fvmptd 5763	. 2 |- ( ph -> ( [_ T / f ]_ P ` A ) = if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) )
43	42, 32	eqtrd 2267	1 |- ( ph -> ( [_ T / f ]_ P ` A ) = ( G ` ( T ` A ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2205   _Vcvv 2815   [_csb 3141   ifcif 3624   class class class wbr 4114   |-> cmpt 4176   -->wf 5353   -1-1-onto->wf1o 5356   ` cfv 5357  (class class class)co 6058   Fincfn 6988   <_ cle 8325   ZZcz 9594   ZZ>=cuz 9871   ...cfz 10361

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-er 6780  df-en 6989  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-fz 10362

This theorem is referenced by:  seq3f1olemqsumkj  10897  seq3f1olemqsumk  10898