Theorem fsum3ser 11360

Description: A finite sum expressed in terms of a partial sum of an infinite series. The recursive definition follows as fsum1 11375 and fsump1 11383, which should make our notation clear and from which, along with closure fsumcl 11363, we will derive the basic properties of finite sums. (Contributed by NM, 11-Dec-2005.) (Revised by Jim Kingdon, 1-Oct-2022.)

Hypotheses

Ref	Expression
fsum3ser.1	|- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> ( F ` k ) = A )
fsum3ser.2	|- ( ph -> N e. ( ZZ>= ` M ) )
fsum3ser.3	|- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> A e. CC )

Assertion

Ref	Expression
fsum3ser	|- ( ph -> sum_ k e. ( M ... N ) A = ( seq M ( + , F ) ` N ) )

Distinct variable groups:   k, F   k, M   k, N   ph, k

Allowed substitution hint:   A( k)

Proof of Theorem fsum3ser

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

Step	Hyp	Ref	Expression
1		eqid 2170	. . . . 5 |- ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) = ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) )
2		eleq1w 2231	. . . . . 6 |- ( m = k -> ( m e. ( M ... N ) <-> k e. ( M ... N ) ) )
3		fveq2 5496	. . . . . 6 |- ( m = k -> ( F ` m ) = ( F ` k ) )
4	2, 3	ifbieq1d 3548	. . . . 5 |- ( m = k -> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) = if ( k e. ( M ... N ) , ( F ` k ) , 0 ) )
5		simpr 109	. . . . 5 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> k e. ( ZZ>= ` M ) )
6		fsum3ser.1	. . . . . . . 8 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> ( F ` k ) = A )
7		fsum3ser.3	. . . . . . . 8 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> A e. CC )
8	6, 7	eqeltrd 2247	. . . . . . 7 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> ( F ` k ) e. CC )
9	8	adantr 274	. . . . . 6 |- ( ( ( ph /\ k e. ( ZZ>= ` M ) ) /\ k e. ( M ... N ) ) -> ( F ` k ) e. CC )
10		0cnd 7913	. . . . . 6 |- ( ( ( ph /\ k e. ( ZZ>= ` M ) ) /\ -. k e. ( M ... N ) ) -> 0 e. CC )
11		eluzelz 9496	. . . . . . 7 |- ( k e. ( ZZ>= ` M ) -> k e. ZZ )
12		eluzel2 9492	. . . . . . 7 |- ( k e. ( ZZ>= ` M ) -> M e. ZZ )
13		fsum3ser.2	. . . . . . . . 9 |- ( ph -> N e. ( ZZ>= ` M ) )
14		eluzelz 9496	. . . . . . . . 9 |- ( N e. ( ZZ>= ` M ) -> N e. ZZ )
15	13, 14	syl 14	. . . . . . . 8 |- ( ph -> N e. ZZ )
16	15	adantr 274	. . . . . . 7 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> N e. ZZ )
17		fzdcel 9996	. . . . . . 7 |- ( ( k e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> DECID k e. ( M ... N ) )
18	11, 12, 16, 17	syl2an23an 1294	. . . . . 6 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> DECID k e. ( M ... N ) )
19	9, 10, 18	ifcldadc 3555	. . . . 5 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> if ( k e. ( M ... N ) , ( F ` k ) , 0 ) e. CC )
20	1, 4, 5, 19	fvmptd3 5589	. . . 4 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> ( ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ` k ) = if ( k e. ( M ... N ) , ( F ` k ) , 0 ) )
21	6	ifeq1d 3543	. . . 4 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> if ( k e. ( M ... N ) , ( F ` k ) , 0 ) = if ( k e. ( M ... N ) , A , 0 ) )
22	20, 21	eqtrd 2203	. . 3 |- ( ( ph /\ k e. ( ZZ>= ` M ) ) -> ( ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ` k ) = if ( k e. ( M ... N ) , A , 0 ) )
23		elfzuz 9977	. . . 4 |- ( k e. ( M ... N ) -> k e. ( ZZ>= ` M ) )
24	23, 7	sylan2 284	. . 3 |- ( ( ph /\ k e. ( M ... N ) ) -> A e. CC )
25		ssidd 3168	. . 3 |- ( ph -> ( M ... N ) C_ ( M ... N ) )
26	22, 13, 24, 18, 25	fsumsersdc 11358	. 2 |- ( ph -> sum_ k e. ( M ... N ) A = ( seq M ( + , ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ) ` N ) )
27	23, 20	sylan2 284	. . . 4 |- ( ( ph /\ k e. ( M ... N ) ) -> ( ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ` k ) = if ( k e. ( M ... N ) , ( F ` k ) , 0 ) )
28		iftrue 3531	. . . . 5 |- ( k e. ( M ... N ) -> if ( k e. ( M ... N ) , ( F ` k ) , 0 ) = ( F ` k ) )
29	28	adantl 275	. . . 4 |- ( ( ph /\ k e. ( M ... N ) ) -> if ( k e. ( M ... N ) , ( F ` k ) , 0 ) = ( F ` k ) )
30	27, 29	eqtrd 2203	. . 3 |- ( ( ph /\ k e. ( M ... N ) ) -> ( ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ` k ) = ( F ` k ) )
31		eleq1w 2231	. . . . . 6 |- ( m = x -> ( m e. ( M ... N ) <-> x e. ( M ... N ) ) )
32		fveq2 5496	. . . . . 6 |- ( m = x -> ( F ` m ) = ( F ` x ) )
33	31, 32	ifbieq1d 3548	. . . . 5 |- ( m = x -> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) = if ( x e. ( M ... N ) , ( F ` x ) , 0 ) )
34		simpr 109	. . . . 5 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> x e. ( ZZ>= ` M ) )
35		fveq2 5496	. . . . . . . 8 |- ( k = x -> ( F ` k ) = ( F ` x ) )
36	35	eleq1d 2239	. . . . . . 7 |- ( k = x -> ( ( F ` k ) e. CC <-> ( F ` x ) e. CC ) )
37	8	ralrimiva 2543	. . . . . . . 8 |- ( ph -> A. k e. ( ZZ>= ` M ) ( F ` k ) e. CC )
38	37	adantr 274	. . . . . . 7 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> A. k e. ( ZZ>= ` M ) ( F ` k ) e. CC )
39	36, 38, 34	rspcdva 2839	. . . . . 6 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. CC )
40		0cnd 7913	. . . . . 6 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> 0 e. CC )
41		eluzelz 9496	. . . . . . 7 |- ( x e. ( ZZ>= ` M ) -> x e. ZZ )
42		eluzel2 9492	. . . . . . 7 |- ( x e. ( ZZ>= ` M ) -> M e. ZZ )
43	15	adantr 274	. . . . . . 7 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> N e. ZZ )
44		fzdcel 9996	. . . . . . 7 |- ( ( x e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> DECID x e. ( M ... N ) )
45	41, 42, 43, 44	syl2an23an 1294	. . . . . 6 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> DECID x e. ( M ... N ) )
46	39, 40, 45	ifcldcd 3561	. . . . 5 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> if ( x e. ( M ... N ) , ( F ` x ) , 0 ) e. CC )
47	1, 33, 34, 46	fvmptd3 5589	. . . 4 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ` x ) = if ( x e. ( M ... N ) , ( F ` x ) , 0 ) )
48	47, 46	eqeltrd 2247	. . 3 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ` x ) e. CC )
49	36	cbvralv 2696	. . . . 5 |- ( A. k e. ( ZZ>= ` M ) ( F ` k ) e. CC <-> A. x e. ( ZZ>= ` M ) ( F ` x ) e. CC )
50	37, 49	sylib 121	. . . 4 |- ( ph -> A. x e. ( ZZ>= ` M ) ( F ` x ) e. CC )
51	50	r19.21bi 2558	. . 3 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. CC )
52		addcl 7899	. . . 4 |- ( ( x e. CC /\ y e. CC ) -> ( x + y ) e. CC )
53	52	adantl 275	. . 3 |- ( ( ph /\ ( x e. CC /\ y e. CC ) ) -> ( x + y ) e. CC )
54	13, 30, 48, 51, 53	seq3fveq 10427	. 2 |- ( ph -> ( seq M ( + , ( m e. ( ZZ>= ` M ) |-> if ( m e. ( M ... N ) , ( F ` m ) , 0 ) ) ) ` N ) = ( seq M ( + , F ) ` N ) )
55	26, 54	eqtrd 2203	1 |- ( ph -> sum_ k e. ( M ... N ) A = ( seq M ( + , F ) ` N ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103  DECID wdc 829   = wceq 1348   e. wcel 2141   A.wral 2448   ifcif 3526   |-> cmpt 4050   ` cfv 5198  (class class class)co 5853   CCcc 7772   0cc0 7774   + caddc 7777   ZZcz 9212   ZZ>=cuz 9487   ...cfz 9965   seqcseq 10401   sum_csu 11316

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-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892  ax-arch 7893  ax-caucvg 7894

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-rmo 2456  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-po 4281  df-iso 4282  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-isom 5207  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-irdg 6349  df-frec 6370  df-1o 6395  df-oadd 6399  df-er 6513  df-en 6719  df-dom 6720  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-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-q 9579  df-rp 9611  df-fz 9966  df-fzo 10099  df-seqfrec 10402  df-exp 10476  df-ihash 10710  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963  df-clim 11242  df-sumdc 11317

This theorem is referenced by:  isumclim3  11386  iserabs  11438  isumsplit  11454  trireciplem  11463  geolim  11474  geo2lim  11479  cvgratnnlemseq  11489  mertenslem2  11499  mertensabs  11500  efcvgfsum  11630  effsumlt  11655  cvgcmp2nlemabs  14064