Theorem gsumsplit1r 13446

Description: Splitting off the rightmost summand of a group sum. This corresponds to the (inductive) definition of a (finite) product in [Lang] p. 4, first formula. (Contributed by AV, 26-Dec-2023.)

Hypotheses

Ref	Expression
gsumsplit1r.b	|- B = ( Base ` G )
gsumsplit1r.p	|- .+ = ( +g ` G )
gsumsplit1r.g	|- ( ph -> G e. V )
gsumsplit1r.m	|- ( ph -> M e. ZZ )
gsumsplit1r.n	|- ( ph -> N e. ( ZZ>= ` M ) )
gsumsplit1r.f	|- ( ph -> F : ( M ... ( N + 1 ) ) --> B )

Assertion

Ref	Expression
gsumsplit1r	|- ( ph -> ( G gsumg F ) = ( ( G gsumg ( F |` ( M ... N ) ) ) .+ ( F ` ( N + 1 ) ) ) )

Proof of Theorem gsumsplit1r

Dummy variables k x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gsumsplit1r.b	. . 3 |- B = ( Base ` G )
2		gsumsplit1r.p	. . 3 |- .+ = ( +g ` G )
3		gsumsplit1r.g	. . 3 |- ( ph -> G e. V )
4		gsumsplit1r.n	. . . 4 |- ( ph -> N e. ( ZZ>= ` M ) )
5		peano2uz 9790	. . . 4 |- ( N e. ( ZZ>= ` M ) -> ( N + 1 ) e. ( ZZ>= ` M ) )
6	4, 5	syl 14	. . 3 |- ( ph -> ( N + 1 ) e. ( ZZ>= ` M ) )
7		gsumsplit1r.f	. . 3 |- ( ph -> F : ( M ... ( N + 1 ) ) --> B )
8	1, 2, 3, 6, 7	gsumval2 13445	. 2 |- ( ph -> ( G gsumg F ) = ( seq M ( .+ , F ) ` ( N + 1 ) ) )
9		gsumsplit1r.m	. . . . . . 7 |- ( ph -> M e. ZZ )
10		eluzelz 9743	. . . . . . . . 9 |- ( N e. ( ZZ>= ` M ) -> N e. ZZ )
11	4, 10	syl 14	. . . . . . . 8 |- ( ph -> N e. ZZ )
12	11	peano2zd 9583	. . . . . . 7 |- ( ph -> ( N + 1 ) e. ZZ )
13	9, 12	fzfigd 10665	. . . . . 6 |- ( ph -> ( M ... ( N + 1 ) ) e. Fin )
14	7, 13	fexd 5873	. . . . 5 |- ( ph -> F e. _V )
15		vex 2802	. . . . 5 |- x e. _V
16		fvexg 5648	. . . . 5 |- ( ( F e. _V /\ x e. _V ) -> ( F ` x ) e. _V )
17	14, 15, 16	sylancl 413	. . . 4 |- ( ph -> ( F ` x ) e. _V )
18	17	adantr 276	. . 3 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. _V )
19		plusgslid 13160	. . . . . . . 8 |- ( +g = Slot ( +g ` ndx ) /\ ( +g ` ndx ) e. NN )
20	19	slotex 13074	. . . . . . 7 |- ( G e. V -> ( +g ` G ) e. _V )
21	3, 20	syl 14	. . . . . 6 |- ( ph -> ( +g ` G ) e. _V )
22	2, 21	eqeltrid 2316	. . . . 5 |- ( ph -> .+ e. _V )
23		vex 2802	. . . . . 6 |- y e. _V
24	23	a1i 9	. . . . 5 |- ( ph -> y e. _V )
25		ovexg 6041	. . . . 5 |- ( ( x e. _V /\ .+ e. _V /\ y e. _V ) -> ( x .+ y ) e. _V )
26	15, 22, 24, 25	mp3an2i 1376	. . . 4 |- ( ph -> ( x .+ y ) e. _V )
27	26	adantr 276	. . 3 |- ( ( ph /\ ( x e. _V /\ y e. _V ) ) -> ( x .+ y ) e. _V )
28	4, 18, 27	seq3p1 10699	. 2 |- ( ph -> ( seq M ( .+ , F ) ` ( N + 1 ) ) = ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) )
29		fzssp1 10275	. . . . . . 7 |- ( M ... N ) C_ ( M ... ( N + 1 ) )
30	29	a1i 9	. . . . . 6 |- ( ph -> ( M ... N ) C_ ( M ... ( N + 1 ) ) )
31	7, 30	fssresd 5504	. . . . 5 |- ( ph -> ( F |` ( M ... N ) ) : ( M ... N ) --> B )
32	1, 2, 3, 4, 31	gsumval2 13445	. . . 4 |- ( ph -> ( G gsumg ( F |` ( M ... N ) ) ) = ( seq M ( .+ , ( F |` ( M ... N ) ) ) ` N ) )
33	9	uzidd 9749	. . . . 5 |- ( ph -> M e. ( ZZ>= ` M ) )
34		resexg 5045	. . . . . . . . . 10 |- ( F e. _V -> ( F |` ( M ... N ) ) e. _V )
35	14, 34	syl 14	. . . . . . . . 9 |- ( ph -> ( F |` ( M ... N ) ) e. _V )
36		fvexg 5648	. . . . . . . . 9 |- ( ( ( F |` ( M ... N ) ) e. _V /\ x e. _V ) -> ( ( F |` ( M ... N ) ) ` x ) e. _V )
37	35, 15, 36	sylancl 413	. . . . . . . 8 |- ( ph -> ( ( F |` ( M ... N ) ) ` x ) e. _V )
38	37	adantr 276	. . . . . . 7 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( ( F |` ( M ... N ) ) ` x ) e. _V )
39	9, 38, 27	seq3-1 10696	. . . . . 6 |- ( ph -> ( seq M ( .+ , ( F |` ( M ... N ) ) ) ` M ) = ( ( F |` ( M ... N ) ) ` M ) )
40		eluzfz1 10239	. . . . . . . 8 |- ( N e. ( ZZ>= ` M ) -> M e. ( M ... N ) )
41	4, 40	syl 14	. . . . . . 7 |- ( ph -> M e. ( M ... N ) )
42	41	fvresd 5654	. . . . . 6 |- ( ph -> ( ( F |` ( M ... N ) ) ` M ) = ( F ` M ) )
43	39, 42	eqtrd 2262	. . . . 5 |- ( ph -> ( seq M ( .+ , ( F |` ( M ... N ) ) ) ` M ) = ( F ` M ) )
44		fzp1ss 10281	. . . . . . . 8 |- ( M e. ZZ -> ( ( M + 1 ) ... N ) C_ ( M ... N ) )
45	9, 44	syl 14	. . . . . . 7 |- ( ph -> ( ( M + 1 ) ... N ) C_ ( M ... N ) )
46	45	sselda 3224	. . . . . 6 |- ( ( ph /\ k e. ( ( M + 1 ) ... N ) ) -> k e. ( M ... N ) )
47	46	fvresd 5654	. . . . 5 |- ( ( ph /\ k e. ( ( M + 1 ) ... N ) ) -> ( ( F |` ( M ... N ) ) ` k ) = ( F ` k ) )
48	33, 43, 38, 18, 27, 4, 47	seq3fveq2 10709	. . . 4 |- ( ph -> ( seq M ( .+ , ( F |` ( M ... N ) ) ) ` N ) = ( seq M ( .+ , F ) ` N ) )
49	32, 48	eqtr2d 2263	. . 3 |- ( ph -> ( seq M ( .+ , F ) ` N ) = ( G gsumg ( F |` ( M ... N ) ) ) )
50	49	oveq1d 6022	. 2 |- ( ph -> ( ( seq M ( .+ , F ) ` N ) .+ ( F ` ( N + 1 ) ) ) = ( ( G gsumg ( F |` ( M ... N ) ) ) .+ ( F ` ( N + 1 ) ) ) )
51	8, 28, 50	3eqtrd 2266	1 |- ( ph -> ( G gsumg F ) = ( ( G gsumg ( F |` ( M ... N ) ) ) .+ ( F ` ( N + 1 ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200   _Vcvv 2799   C_ wss 3197   |` cres 4721   -->wf 5314   ` cfv 5318  (class class class)co 6007   Fincfn 6895   1c1 8011   + caddc 8013   ZZcz 9457   ZZ>=cuz 9733   ...cfz 10216   seqcseq 10681   Basecbs 13047   +g cplusg 13125   gsum_g cgsu 13305

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-frec 6543  df-1o 6568  df-er 6688  df-en 6896  df-fin 6898  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-inn 9122  df-2 9180  df-n0 9381  df-z 9458  df-uz 9734  df-fz 10217  df-seqfrec 10682  df-ndx 13050  df-slot 13051  df-base 13053  df-plusg 13138  df-0g 13306  df-igsum 13307

This theorem is referenced by:  gsumfzconst  13893  gsumfzfsumlemm  14566