Theorem seqfeq3 10316

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 2140	. . . 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 10265	. . 3 |- ( ph -> seq M ( .+ , F ) : ( ZZ>= ` M ) --> S )
6	5	ffnd 5281	. 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 2218	. . . 4 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x Q y ) e. S )
9	1, 2, 3, 8	seqf 10265	. . 3 |- ( ph -> seq M ( Q , F ) : ( ZZ>= ` M ) --> S )
10	9	ffnd 5281	. 2 |- ( ph -> seq M ( Q , F ) Fn ( ZZ>= ` M ) )
11	5	ffvelrnda 5563	. . . 4 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( seq M ( .+ , F ) ` a ) e. S )
12		fvi 5486	. . . 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 469	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) e. S )
15	3	adantlr 469	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. S )
16		simpr 109	. . . 4 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> a e. ( ZZ>= ` M ) )
17	7	adantlr 469	. . . . 5 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( x .+ y ) = ( x Q y ) )
18		fvi 5486	. . . . . 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 5486	. . . . . . 7 |- ( x e. S -> ( _I ` x ) = x )
21	20	ad2antrl 482	. . . . . 6 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` x ) = x )
22		fvi 5486	. . . . . . 7 |- ( y e. S -> ( _I ` y ) = y )
23	22	ad2antll 483	. . . . . 6 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` y ) = y )
24	21, 23	oveq12d 5800	. . . . 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 2183	. . . 4 |- ( ( ( ph /\ a e. ( ZZ>= ` M ) ) /\ ( x e. S /\ y e. S ) ) -> ( _I ` ( x .+ y ) ) = ( ( _I ` x ) Q ( _I ` y ) ) )
26		fvi 5486	. . . . 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 469	. . . 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 10314	. . 3 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( _I ` ( seq M ( .+ , F ) ` a ) ) = ( seq M ( Q , F ) ` a ) )
30	13, 29	eqtr3d 2175	. 2 |- ( ( ph /\ a e. ( ZZ>= ` M ) ) -> ( seq M ( .+ , F ) ` a ) = ( seq M ( Q , F ) ` a ) )
31	6, 10, 30	eqfnfvd 5529	1 |- ( ph -> seq M ( .+ , F ) = seq M ( Q , F ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1332   e. wcel 1481   _I cid 4218   ` cfv 5131  (class class class)co 5782   ZZcz 9078   ZZ>=cuz 9350   seqcseq 10249

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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510  ax-cnex 7735  ax-resscn 7736  ax-1cn 7737  ax-1re 7738  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-addcom 7744  ax-addass 7746  ax-distr 7748  ax-i2m1 7749  ax-0lt1 7750  ax-0id 7752  ax-rnegex 7753  ax-cnre 7755  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-pre-ltadd 7760

This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-ilim 4299  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-frec 6296  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-sub 7959  df-neg 7960  df-inn 8745  df-n0 9002  df-z 9079  df-uz 9351  df-seqfrec 10250

This theorem is referenced by: (None)