ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isumz Unicode version

Theorem isumz 11397
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.
StepHypRef Expression
1 eqid 2177 . . . 4  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
2 simp1 997 . . . 4  |-  ( ( M  e.  ZZ  /\  A  C_  ( ZZ>= `  M
)  /\  A. j  e.  ( ZZ>= `  M )DECID  j  e.  A )  ->  M  e.  ZZ )
3 simp2 998 . . . 4  |-  ( ( M  e.  ZZ  /\  A  C_  ( ZZ>= `  M
)  /\  A. j  e.  ( ZZ>= `  M )DECID  j  e.  A )  ->  A  C_  ( ZZ>= `  M )
)
4 c0ex 7951 . . . . . . 7  |-  0  e.  _V
54fvconst2 5733 . . . . . 6  |-  ( k  e.  ( ZZ>= `  M
)  ->  ( (
( ZZ>= `  M )  X.  { 0 } ) `
 k )  =  0 )
65adantl 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 2238 . . . . . . . 8  |-  ( j  =  k  ->  (
j  e.  A  <->  k  e.  A ) )
87dcbid 838 . . . . . . 7  |-  ( j  =  k  ->  (DECID  j  e.  A  <-> DECID  k  e.  A )
)
9 simpl3 1002 . . . . . . 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 ) )
118, 9, 10rspcdva 2847 . . . . . 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 3569 . . . . . 6  |-  (DECID  k  e.  A  ->  if (
k  e.  A , 
0 ,  0 )  =  0 )
1311, 12syl 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 )
146, 13eqtr4d 2213 . . . 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 999 . . . . 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 2238 . . . . . . 7  |-  ( j  =  a  ->  (
j  e.  A  <->  a  e.  A ) )
1716dcbid 838 . . . . . 6  |-  ( j  =  a  ->  (DECID  j  e.  A  <-> DECID  a  e.  A )
)
1817cbvralv 2704 . . . . 5  |-  ( A. j  e.  ( ZZ>= `  M )DECID  j  e.  A  <->  A. a  e.  ( ZZ>= `  M )DECID  a  e.  A )
1915, 18sylib 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 7950 . . . 4  |-  ( ( ( M  e.  ZZ  /\  A  C_  ( ZZ>= `  M )  /\  A. j  e.  ( ZZ>= `  M )DECID  j  e.  A )  /\  k  e.  A
)  ->  0  e.  CC )
211, 2, 3, 14, 19, 20zsumdc 11392 . . 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 11302 . . . . 5  |-  ~~>  : dom  ~~>  --> CC
23 ffun 5369 . . . . 5  |-  (  ~~>  : dom  ~~>  --> CC 
->  Fun  ~~>  )
2422, 23ax-mp 5 . . . 4  |-  Fun  ~~>
25 serclim0 11313 . . . . 5  |-  ( M  e.  ZZ  ->  seq M (  +  , 
( ( ZZ>= `  M
)  X.  { 0 } ) )  ~~>  0 )
262, 25syl 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 5555 . . . 4  |-  ( Fun  ~~>  ->  (  seq M (  +  ,  ( (
ZZ>= `  M )  X. 
{ 0 } ) )  ~~>  0  ->  (  ~~>  ` 
seq M (  +  ,  ( ( ZZ>= `  M )  X.  {
0 } ) ) )  =  0 ) )
2824, 26, 27mpsyl 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 )
2921, 28eqtrd 2210 . 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 11383 . . 3  |-  ( A  e.  Fin  ->  ( A  =  (/)  \/  (
( `  A )  e.  NN  /\  E. f 
f : ( 1 ... ( `  A
) ) -1-1-onto-> A ) ) )
31 sumeq1 11363 . . . . 5  |-  ( A  =  (/)  ->  sum_ k  e.  A  0  =  sum_ k  e.  (/)  0 )
32 sum0 11396 . . . . 5  |-  sum_ k  e.  (/)  0  =  0
3331, 32eqtrdi 2226 . . . 4  |-  ( A  =  (/)  ->  sum_ k  e.  A  0  = 
0 )
34 eqidd 2178 . . . . . . . . 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 7950 . . . . . . . . 9  |-  ( ( ( ( `  A
)  e.  NN  /\  f : ( 1 ... ( `  A )
)
-1-1-onto-> A )  /\  k  e.  A )  ->  0  e.  CC )
38 elfznn 10054 . . . . . . . . . . 11  |-  ( n  e.  ( 1 ... ( `  A )
)  ->  n  e.  NN )
394fvconst2 5733 . . . . . . . . . . 11  |-  ( n  e.  NN  ->  (
( NN  X.  {
0 } ) `  n )  =  0 )
4038, 39syl 14 . . . . . . . . . 10  |-  ( n  e.  ( 1 ... ( `  A )
)  ->  ( ( NN  X.  { 0 } ) `  n )  =  0 )
4140adantl 277 . . . . . . . . 9  |-  ( ( ( ( `  A
)  e.  NN  /\  f : ( 1 ... ( `  A )
)
-1-1-onto-> A )  /\  n  e.  ( 1 ... ( `  A ) ) )  ->  ( ( NN 
X.  { 0 } ) `  n )  =  0 )
4234, 35, 36, 37, 41fsum3 11395 . . . . . . . 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 9563 . . . . . . . . . . . . 13  |-  NN  =  ( ZZ>= `  1 )
4443fser0const 10516 . . . . . . . . . . . 12  |-  ( ( `  A )  e.  NN  ->  ( n  e.  NN  |->  if ( n  <_  ( `  A ) ,  ( ( NN  X.  {
0 } ) `  n ) ,  0 ) )  =  ( NN  X.  { 0 } ) )
4544seqeq3d 10453 . . . . . . . . . . 11  |-  ( ( `  A )  e.  NN  ->  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  ( `  A ) ,  ( ( NN 
X.  { 0 } ) `  n ) ,  0 ) ) )  =  seq 1
(  +  ,  ( NN  X.  { 0 } ) ) )
4645fveq1d 5518 . . . . . . . . . 10  |-  ( ( `  A )  e.  NN  ->  (  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  ( `  A
) ,  ( ( NN  X.  { 0 } ) `  n
) ,  0 ) ) ) `  ( `  A ) )  =  (  seq 1 (  +  ,  ( NN 
X.  { 0 } ) ) `  ( `  A ) ) )
4743ser0 10514 . . . . . . . . . 10  |-  ( ( `  A )  e.  NN  ->  (  seq 1 (  +  ,  ( NN 
X.  { 0 } ) ) `  ( `  A ) )  =  0 )
4846, 47eqtrd 2210 . . . . . . . . 9  |-  ( ( `  A )  e.  NN  ->  (  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  ( `  A
) ,  ( ( NN  X.  { 0 } ) `  n
) ,  0 ) ) ) `  ( `  A ) )  =  0 )
4935, 48syl 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 )
5042, 49eqtrd 2210 . . . . . . 7  |-  ( ( ( `  A )  e.  NN  /\  f : ( 1 ... ( `  A ) ) -1-1-onto-> A )  ->  sum_ k  e.  A 
0  =  0 )
5150ex 115 . . . . . 6  |-  ( ( `  A )  e.  NN  ->  ( f : ( 1 ... ( `  A
) ) -1-1-onto-> A  ->  sum_ k  e.  A  0  =  0 ) )
5251exlimdv 1819 . . . . 5  |-  ( ( `  A )  e.  NN  ->  ( E. f  f : ( 1 ... ( `  A )
)
-1-1-onto-> A  ->  sum_ k  e.  A 
0  =  0 ) )
5352imp 124 . . . 4  |-  ( ( ( `  A )  e.  NN  /\  E. f 
f : ( 1 ... ( `  A
) ) -1-1-onto-> A )  ->  sum_ k  e.  A  0  = 
0 )
5433, 53jaoi 716 . . 3  |-  ( ( A  =  (/)  \/  (
( `  A )  e.  NN  /\  E. f 
f : ( 1 ... ( `  A
) ) -1-1-onto-> A ) )  ->  sum_ k  e.  A  0  =  0 )
5530, 54syl 14 . 2  |-  ( A  e.  Fin  ->  sum_ k  e.  A  0  = 
0 )
5629, 55jaoi 716 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 )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 708  DECID wdc 834    /\ w3a 978    = wceq 1353   E.wex 1492    e. wcel 2148   A.wral 2455    C_ wss 3130   (/)c0 3423   ifcif 3535   {csn 3593   class class class wbr 4004    |-> cmpt 4065    X. cxp 4625   dom cdm 4627   Fun wfun 5211   -->wf 5213   -1-1-onto->wf1o 5216   ` cfv 5217  (class class class)co 5875   Fincfn 6740   CCcc 7809   0cc0 7811   1c1 7812    + caddc 7814    <_ cle 7993   NNcn 8919   ZZcz 9253   ZZ>=cuz 9528   ...cfz 10008    seqcseq 10445  ♯chash 10755    ~~> cli 11286   sum_csu 11361
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-nul 4130  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-iinf 4588  ax-cnex 7902  ax-resscn 7903  ax-1cn 7904  ax-1re 7905  ax-icn 7906  ax-addcl 7907  ax-addrcl 7908  ax-mulcl 7909  ax-mulrcl 7910  ax-addcom 7911  ax-mulcom 7912  ax-addass 7913  ax-mulass 7914  ax-distr 7915  ax-i2m1 7916  ax-0lt1 7917  ax-1rid 7918  ax-0id 7919  ax-rnegex 7920  ax-precex 7921  ax-cnre 7922  ax-pre-ltirr 7923  ax-pre-ltwlin 7924  ax-pre-lttrn 7925  ax-pre-apti 7926  ax-pre-ltadd 7927  ax-pre-mulgt0 7928  ax-pre-mulext 7929  ax-arch 7930  ax-caucvg 7931
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-if 3536  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-tr 4103  df-id 4294  df-po 4297  df-iso 4298  df-iord 4367  df-on 4369  df-ilim 4370  df-suc 4372  df-iom 4591  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-isom 5226  df-riota 5831  df-ov 5878  df-oprab 5879  df-mpo 5880  df-1st 6141  df-2nd 6142  df-recs 6306  df-irdg 6371  df-frec 6392  df-1o 6417  df-oadd 6421  df-er 6535  df-en 6741  df-dom 6742  df-fin 6743  df-pnf 7994  df-mnf 7995  df-xr 7996  df-ltxr 7997  df-le 7998  df-sub 8130  df-neg 8131  df-reap 8532  df-ap 8539  df-div 8630  df-inn 8920  df-2 8978  df-3 8979  df-4 8980  df-n0 9177  df-z 9254  df-uz 9529  df-q 9620  df-rp 9654  df-fz 10009  df-fzo 10143  df-seqfrec 10446  df-exp 10520  df-ihash 10756  df-cj 10851  df-re 10852  df-im 10853  df-rsqrt 11007  df-abs 11008  df-clim 11287  df-sumdc 11362
This theorem is referenced by:  fsum00  11470  pcfac  12348  nconstwlpolem0  14813
  Copyright terms: Public domain W3C validator