Theorem seqfeq3 10638

Description: Equality of series under different addition operations which agree on an additively closed subset. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 25-Apr-2016.)

Hypotheses

Ref	Expression
seqfeq3.m	|- ( ph -> M e. ZZ )
seqfeq3.f	|- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. S )
seqfeq3.cl	|- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) e. S )
seqfeq3.id	|- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) = ( x Q y ) )

Assertion

Ref	Expression
seqfeq3	|- ( ph -> seq M ( .+ , F ) = seq M ( Q , F ) )

Distinct variable groups:   ph, x, y   x, F, y   x, M, y   x, .+ , y   x, Q, y   x, S, y

Proof of Theorem seqfeq3

Dummy variable a is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2196	. . . 4 |- ( ZZ>= ` M ) = ( ZZ>= ` M )
2		seqfeq3.m	. . . 4 |- ( ph -> M e. ZZ )
3		seqfeq3.f	. . . 4 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. S )
4		seqfeq3.cl	. . . 4 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) e. S )
5	1, 2, 3, 4	seqf 10573	. . 3 |- ( ph -> seq M ( .+ , F ) : ( ZZ>= ` M ) --> S )
6	5	ffnd 5411	. 2 |- ( ph -> seq M ( .+ , F ) Fn ( ZZ>= ` M ) )
7		seqfeq3.id	. . . . 5 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) = ( x Q y ) )
8	7, 4	eqeltrrd 2274	. . . 4 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x Q y ) e. S )
9	1, 2, 3, 8	seqf 10573	. . 3 |- ( ph -> seq M ( Q , F ) : ( ZZ>= ` M ) --> S )
10	9	ffnd 5411	. 2 |- ( ph -> seq M ( Q , F ) Fn ( ZZ>= ` M ) )
11	5	ffvelcdmda 5700	. . . 4 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( seq M ( .+ , F ) ` a ) e. S )
12		fvi 5621	. . . 4 |- ( ( seq M ( .+ , F ) ` a ) e. S -> ( _I ` ( seq M ( .+ , F ) ` a ) ) = ( seq M ( .+ , F ) ` a ) )
13	11, 12	syl 14	. . 3 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( _I ` ( seq M ( .+ , F ) ` a ) ) = ( seq M ( .+ , F ) ` a ) )
14	4	adantlr 477	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) e. S )
15	3	adantlr 477	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. S )
16		simpr 110	. . . 4 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> a e. ( ZZ>= ` M ) )
17	7	adantlr 477	. . . . 5 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) = ( x Q y ) )
18		fvi 5621	. . . . . 6 |- ( ( x .+ y ) e. S -> ( _I ` ( x .+ y ) ) = ( x .+ y ) )
19	14, 18	syl 14	. . . . 5 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` ( x .+ y ) ) = ( x .+ y ) )
20		fvi 5621	. . . . . . 7 |- ( x e. S -> ( _I ` x ) = x )
21	20	ad2antrl 490	. . . . . 6 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` x ) = x )
22		fvi 5621	. . . . . . 7 |- ( y e. S -> ( _I ` y ) = y )
23	22	ad2antll 491	. . . . . 6 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` y ) = y )
24	21, 23	oveq12d 5943	. . . . 5 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( ( _I ` x ) Q ( _I ` y ) ) = ( x Q y ) )
25	17, 19, 24	3eqtr4d 2239	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` ( x .+ y ) ) = ( ( _I ` x ) Q ( _I ` y ) ) )
26		fvi 5621	. . . . 5 |- ( ( F ` x ) e. S -> ( _I ` ( F ` x ) ) = ( F ` x ) )
27	15, 26	syl 14	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ x e. ( ZZ>= ` M ) ) -> ( _I ` ( F ` x ) ) = ( F ` x ) )
28	8	adantlr 477	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( x Q y ) e. S )
29	14, 15, 16, 25, 27, 15, 28	seq3homo 10636	. . 3 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( _I ` ( seq M ( .+ , F ) ` a ) ) = ( seq M ( Q , F ) ` a ) )
30	13, 29	eqtr3d 2231	. 2 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( seq M ( .+ , F ) ` a ) = ( seq M ( Q , F ) ` a ) )
31	6, 10, 30	eqfnfvd 5665	1 |- ( ph -> seq M ( .+ , F ) = seq M ( Q , F ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2167   _I cid 4324   ` cfv 5259  (class class class)co 5925   ZZcz 9343   ZZ>=cuz 9618   seqcseq 10556

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-seqfrec 10557

This theorem is referenced by:  mulgpropdg  13370