Theorem iseqf1olemfvp 10453

Description: Lemma for seq3f1o 10460. (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 3076	. . . 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 5442	. . . . . . 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 9980	. . . . . . . 8 |- ( K e. ( M ... N ) -> M e. ZZ )
8	6, 7	syl 14	. . . . . . 7 |- ( ph -> M e. ZZ )
9		elfzel2 9979	. . . . . . . 8 |- ( K e. ( M ... N ) -> N e. ZZ )
10	6, 9	syl 14	. . . . . . 7 |- ( ph -> N e. ZZ )
11	8, 10	fzfigd 10387	. . . . . 6 |- ( ph -> ( M ... N ) e. Fin )
12		fex 5725	. . . . . 6 |- ( ( T : ( M ... N ) --> ( M ... N ) /\ ( M ... N ) e. Fin ) -> T e. _V )
13	5, 11, 12	syl2anc 409	. . . . 5 |- ( ph -> T e. _V )
14		nfcvd 2313	. . . . . 6 |- ( T e. _V -> F/_ f ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
15		fveq1 5495	. . . . . . . . 9 |- ( f = T -> ( f ` x ) = ( T ` x ) )
16	15	fveq2d 5500	. . . . . . . 8 |- ( f = T -> ( G ` ( f ` x ) ) = ( G ` ( T ` x ) ) )
17	16	ifeq1d 3543	. . . . . . 7 |- ( f = T -> if ( x <_ N , ( G ` ( f ` x ) ) , ( G ` M ) ) = if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) )
18	17	mpteq2dv 4080	. . . . . 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 3092	. . . . 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 2215	. . 3 |- ( ph -> [_ T / f ]_ P = ( x e. ( ZZ>= ` M ) |-> if ( x <_ N , ( G ` ( T ` x ) ) , ( G ` M ) ) ) )
22		simpr 109	. . . . 5 |- ( ( ph /\ x = A ) -> x = A )
23	22	breq1d 3999	. . . 4 |- ( ( ph /\ x = A ) -> ( x <_ N <-> A <_ N ) )
24	22	fveq2d 5500	. . . . 5 |- ( ( ph /\ x = A ) -> ( T ` x ) = ( T ` A ) )
25	24	fveq2d 5500	. . . 4 |- ( ( ph /\ x = A ) -> ( G ` ( T ` x ) ) = ( G ` ( T ` A ) ) )
26	23, 25	ifbieq1d 3548	. . 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 9977	. . . 4 |- ( A e. ( M ... N ) -> A e. ( ZZ>= ` M ) )
29	27, 28	syl 14	. . 3 |- ( ph -> A e. ( ZZ>= ` M ) )
30		elfzle2 9984	. . . . . 6 |- ( A e. ( M ... N ) -> A <_ N )
31	27, 30	syl 14	. . . . 5 |- ( ph -> A <_ N )
32	31	iftrued 3533	. . . 4 |- ( ph -> if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) = ( G ` ( T ` A ) ) )
33		fveq2 5496	. . . . . 6 |- ( x = ( T ` A ) -> ( G ` x ) = ( G ` ( T ` A ) ) )
34	33	eleq1d 2239	. . . . 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 2543	. . . . 5 |- ( ph -> A. x e. ( ZZ>= ` M ) ( G ` x ) e. S )
37	5, 27	ffvelrnd 5632	. . . . . 6 |- ( ph -> ( T ` A ) e. ( M ... N ) )
38		elfzuz 9977	. . . . . 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 2839	. . . 4 |- ( ph -> ( G ` ( T ` A ) ) e. S )
41	32, 40	eqeltrd 2247	. . 3 |- ( ph -> if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) e. S )
42	21, 26, 29, 41	fvmptd 5577	. 2 |- ( ph -> ( [_ T / f ]_ P ` A ) = if ( A <_ N , ( G ` ( T ` A ) ) , ( G ` M ) ) )
43	42, 32	eqtrd 2203	1 |- ( ph -> ( [_ T / f ]_ P ` A ) = ( G ` ( T ` A ) ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1348   e. wcel 2141   _Vcvv 2730   [_csb 3049   ifcif 3526   class class class wbr 3989   |-> cmpt 4050   -->wf 5194   -1-1-onto->wf1o 5197   ` cfv 5198  (class class class)co 5853   Fincfn 6718   <_ cle 7955   ZZcz 9212   ZZ>=cuz 9487   ...cfz 9965

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-1o 6395  df-er 6513  df-en 6719  df-fin 6721  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213  df-uz 9488  df-fz 9966

This theorem is referenced by:  seq3f1olemqsumkj  10454  seq3f1olemqsumk  10455