Theorem isumz 12156

Description: Any sum of zero over a summable set is zero. (Contributed by Mario Carneiro, 12-Aug-2013.) (Revised by Jim Kingdon, 9-Apr-2023.)

Assertion

Ref	Expression
isumz	|- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) \/ A e. Fin ) -> sum_ k e. A 0 = 0 )

Distinct variable groups:   A, j, k   j, M, k

Proof of Theorem isumz

Dummy variables a f n are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2238	. . . 4 |- ( ZZ>= ` M ) = ( ZZ>= ` M )
2		simp1 1028	. . . 4 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> M e. ZZ )
3		simp2 1029	. . . 4 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> A C_ ( ZZ>= ` M ) )
4		c0ex 8320	. . . . . . 7 |- 0 e. _V
5	4	fvconst2 5931	. . . . . 6 |- ( k e. ( ZZ>= ` M ) -> ( ( ( ZZ>= ` M ) X. { 0 } ) ` k ) = 0 )
6	5	adantl 277	. . . . 5 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. ( ZZ>= ` M ) ) -> ( ( ( ZZ>= ` M ) X. { 0 } ) ` k ) = 0 )
7		eleq1w 2299	. . . . . . . 8 |- ( j = k -> ( j e. A <-> k e. A ) )
8	7	dcbid 850	. . . . . . 7 |- ( j = k -> (DECID j e. A <-> DECID k e. A ) )
9		simpl3 1033	. . . . . . 7 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. ( ZZ>= ` M ) ) -> A. j e. ( ZZ>= ` M )DECID j e. A )
10		simpr 110	. . . . . . 7 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. ( ZZ>= ` M ) ) -> k e. ( ZZ>= ` M ) )
11	8, 9, 10	rspcdva 2934	. . . . . 6 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. ( ZZ>= ` M ) ) -> DECID k e. A )
12		ifiddc 3676	. . . . . 6 |- (DECID k e. A -> if ( k e. A , 0 , 0 ) = 0 )
13	11, 12	syl 14	. . . . 5 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. ( ZZ>= ` M ) ) -> if ( k e. A , 0 , 0 ) = 0 )
14	6, 13	eqtr4d 2274	. . . 4 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. ( ZZ>= ` M ) ) -> ( ( ( ZZ>= ` M ) X. { 0 } ) ` k ) = if ( k e. A , 0 , 0 ) )
15		simp3 1030	. . . . 5 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> A. j e. ( ZZ>= ` M )DECID j e. A )
16		eleq1w 2299	. . . . . . 7 |- ( j = a -> ( j e. A <-> a e. A ) )
17	16	dcbid 850	. . . . . 6 |- ( j = a -> (DECID j e. A <-> DECID a e. A ) )
18	17	cbvralv 2786	. . . . 5 |- ( A. j e. ( ZZ>= ` M )DECID j e. A <-> A. a e. ( ZZ>= ` M )DECID a e. A )
19	15, 18	sylib 122	. . . 4 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> A. a e. ( ZZ>= ` M )DECID a e. A )
20		0cnd 8319	. . . 4 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) /\ k e. A ) -> 0 e. CC )
21	1, 2, 3, 14, 19, 20	zsumdc 12151	. . 3 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> sum_ k e. A 0 = ( ~~> ` seq M ( + , ( ( ZZ>= ` M ) X. { 0 } ) ) ) )
22		fclim 12060	. . . . 5 |- ~~> : dom ~~> --> CC
23		ffun 5536	. . . . 5 |- ( ~~> : dom ~~> --> CC -> Fun ~~> )
24	22, 23	ax-mp 5	. . . 4 |- Fun ~~>
25		serclim0 12071	. . . . 5 |- ( M e. ZZ -> seq M ( + , ( ( ZZ>= ` M ) X. { 0 } ) ) ~~> 0 )
26	2, 25	syl 14	. . . 4 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> seq M ( + , ( ( ZZ>= ` M ) X. { 0 } ) ) ~~> 0 )
27		funbrfv 5739	. . . 4 |- ( Fun ~~> -> ( seq M ( + , ( ( ZZ>= ` M ) X. { 0 } ) ) ~~> 0 -> ( ~~> ` seq M ( + , ( ( ZZ>= ` M ) X. { 0 } ) ) ) = 0 ) )
28	24, 26, 27	mpsyl 65	. . 3 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> ( ~~> ` seq M ( + , ( ( ZZ>= ` M ) X. { 0 } ) ) ) = 0 )
29	21, 28	eqtrd 2271	. 2 |- ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) -> sum_ k e. A 0 = 0 )
30		fz1f1o 12141	. . 3 |- ( A e. Fin -> ( A = (/) \/ ( (♯ ` A ) e. NN /\ E. f f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) ) )
31		sumeq1 12121	. . . . 5 |- ( A = (/) -> sum_ k e. A 0 = sum_ k e. (/) 0 )
32		sum0 12155	. . . . 5 |- sum_ k e. (/) 0 = 0
33	31, 32	eqtrdi 2287	. . . 4 |- ( A = (/) -> sum_ k e. A 0 = 0 )
34		eqidd 2239	. . . . . . . . 9 |- ( k = ( f ` n ) -> 0 = 0 )
35		simpl 109	. . . . . . . . 9 |- ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) -> (♯ ` A ) e. NN )
36		simpr 110	. . . . . . . . 9 |- ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) -> f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A )
37		0cnd 8319	. . . . . . . . 9 |- ( ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) /\ k e. A ) -> 0 e. CC )
38		elfznn 10460	. . . . . . . . . . 11 |- ( n e. ( 1 ... (♯ ` A ) ) -> n e. NN )
39	4	fvconst2 5931	. . . . . . . . . . 11 |- ( n e. NN -> ( ( NN X. { 0 } ) ` n ) = 0 )
40	38, 39	syl 14	. . . . . . . . . 10 |- ( n e. ( 1 ... (♯ ` A ) ) -> ( ( NN X. { 0 } ) ` n ) = 0 )
41	40	adantl 277	. . . . . . . . 9 |- ( ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) /\ n e. ( 1 ... (♯ ` A ) ) ) -> ( ( NN X. { 0 } ) ` n ) = 0 )
42	34, 35, 36, 37, 41	fsum3 12154	. . . . . . . 8 |- ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) -> sum_ k e. A 0 = ( seq 1 ( + , ( n e. NN |-> if ( n <_ (♯ ` A ) , ( ( NN X. { 0 } ) ` n ) , 0 ) ) ) ` (♯ ` A ) ) )
43		nnuz 9958	. . . . . . . . . . . . 13 |- NN = ( ZZ>= ` 1 )
44	43	fser0const 10972	. . . . . . . . . . . 12 |- ( (♯ ` A ) e. NN -> ( n e. NN |-> if ( n <_ (♯ ` A ) , ( ( NN X. { 0 } ) ` n ) , 0 ) ) = ( NN X. { 0 } ) )
45	44	seqeq3d 10892	. . . . . . . . . . 11 |- ( (♯ ` A ) e. NN -> seq 1 ( + , ( n e. NN |-> if ( n <_ (♯ ` A ) , ( ( NN X. { 0 } ) ` n ) , 0 ) ) ) = seq 1 ( + , ( NN X. { 0 } ) ) )
46	45	fveq1d 5697	. . . . . . . . . 10 |- ( (♯ ` A ) e. NN -> ( seq 1 ( + , ( n e. NN |-> if ( n <_ (♯ ` A ) , ( ( NN X. { 0 } ) ` n ) , 0 ) ) ) ` (♯ ` A ) ) = ( seq 1 ( + , ( NN X. { 0 } ) ) ` (♯ ` A ) ) )
47	43	ser0 10970	. . . . . . . . . 10 |- ( (♯ ` A ) e. NN -> ( seq 1 ( + , ( NN X. { 0 } ) ) ` (♯ ` A ) ) = 0 )
48	46, 47	eqtrd 2271	. . . . . . . . 9 |- ( (♯ ` A ) e. NN -> ( seq 1 ( + , ( n e. NN |-> if ( n <_ (♯ ` A ) , ( ( NN X. { 0 } ) ` n ) , 0 ) ) ) ` (♯ ` A ) ) = 0 )
49	35, 48	syl 14	. . . . . . . 8 |- ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) -> ( seq 1 ( + , ( n e. NN |-> if ( n <_ (♯ ` A ) , ( ( NN X. { 0 } ) ` n ) , 0 ) ) ) ` (♯ ` A ) ) = 0 )
50	42, 49	eqtrd 2271	. . . . . . 7 |- ( ( (♯ ` A ) e. NN /\ f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) -> sum_ k e. A 0 = 0 )
51	50	ex 115	. . . . . 6 |- ( (♯ ` A ) e. NN -> ( f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A -> sum_ k e. A 0 = 0 ) )
52	51	exlimdv 1872	. . . . 5 |- ( (♯ ` A ) e. NN -> ( E. f f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A -> sum_ k e. A 0 = 0 ) )
53	52	imp 124	. . . 4 |- ( ( (♯ ` A ) e. NN /\ E. f f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) -> sum_ k e. A 0 = 0 )
54	33, 53	jaoi 728	. . 3 |- ( ( A = (/) \/ ( (♯ ` A ) e. NN /\ E. f f : ( 1 ... (♯ ` A ) ) -1-1-onto-> A ) ) -> sum_ k e. A 0 = 0 )
55	30, 54	syl 14	. 2 |- ( A e. Fin -> sum_ k e. A 0 = 0 )
56	29, 55	jaoi 728	1 |- ( ( ( M e. ZZ /\ A C_ ( ZZ>= ` M ) /\ A. j e. ( ZZ>= ` M )DECID j e. A ) \/ A e. Fin ) -> sum_ k e. A 0 = 0 )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   \/ wo 720  DECID wdc 846   /\ w3a 1009   = wceq 1402   E.wex 1545   e. wcel 2209   A.wral 2528   C_ wss 3220   (/)c0 3520   ifcif 3638   {csn 3709   class class class wbr 4130   |-> cmpt 4192   X. cxp 4772   dom cdm 4774   Fun wfun 5371   -->wf 5373   -1-1-onto->wf1o 5376   ` cfv 5377  (class class class)co 6085   Fincfn 7022   CCcc 8177   0cc0 8179   1c1 8180   + caddc 8182   <_ cle 8361   NNcn 9304   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411   seqcseq 10884  ♯chash 11214   ~~> cli 12044   sum_csu 12119

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-oadd 6691  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-fz 10412  df-fzo 10550  df-seqfrec 10885  df-exp 10976  df-ihash 11215  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-clim 12045  df-sumdc 12120

This theorem is used by:  fsum00  12229  fsumdvds  12609  pcfac  13129  plymullem1  15849  nconstwlpolem0  17113