MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sumz Structured version   Visualization version   Unicode version

Theorem sumz 13865
Description: Any sum of zero over a summable set is zero. (Contributed by Mario Carneiro, 12-Aug-2013.) (Revised by Mario Carneiro, 20-Apr-2014.)
Assertion
Ref Expression
sumz  |-  ( ( A  C_  ( ZZ>= `  M )  \/  A  e.  Fin )  ->  sum_ k  e.  A  0  = 
0 )
Distinct variable groups:    A, k    k, M

Proof of Theorem sumz
Dummy variables  f  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2471 . . . . 5  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
2 simpr 468 . . . . 5  |-  ( ( A  C_  ( ZZ>= `  M )  /\  M  e.  ZZ )  ->  M  e.  ZZ )
3 simpl 464 . . . . 5  |-  ( ( A  C_  ( ZZ>= `  M )  /\  M  e.  ZZ )  ->  A  C_  ( ZZ>= `  M )
)
4 c0ex 9655 . . . . . . . 8  |-  0  e.  _V
54fvconst2 6136 . . . . . . 7  |-  ( k  e.  ( ZZ>= `  M
)  ->  ( (
( ZZ>= `  M )  X.  { 0 } ) `
 k )  =  0 )
6 ifid 3909 . . . . . . 7  |-  if ( k  e.  A , 
0 ,  0 )  =  0
75, 6syl6eqr 2523 . . . . . 6  |-  ( k  e.  ( ZZ>= `  M
)  ->  ( (
( ZZ>= `  M )  X.  { 0 } ) `
 k )  =  if ( k  e.  A ,  0 ,  0 ) )
87adantl 473 . . . . 5  |-  ( ( ( A  C_  ( ZZ>=
`  M )  /\  M  e.  ZZ )  /\  k  e.  ( ZZ>=
`  M ) )  ->  ( ( (
ZZ>= `  M )  X. 
{ 0 } ) `
 k )  =  if ( k  e.  A ,  0 ,  0 ) )
9 0cnd 9654 . . . . 5  |-  ( ( ( A  C_  ( ZZ>=
`  M )  /\  M  e.  ZZ )  /\  k  e.  A
)  ->  0  e.  CC )
101, 2, 3, 8, 9zsum 13861 . . . 4  |-  ( ( A  C_  ( ZZ>= `  M )  /\  M  e.  ZZ )  ->  sum_ k  e.  A  0  =  ( 
~~>  `  seq M (  +  ,  ( (
ZZ>= `  M )  X. 
{ 0 } ) ) ) )
11 fclim 13694 . . . . . 6  |-  ~~>  : dom  ~~>  --> CC
12 ffun 5742 . . . . . 6  |-  (  ~~>  : dom  ~~>  --> CC 
->  Fun  ~~>  )
1311, 12ax-mp 5 . . . . 5  |-  Fun  ~~>
14 serclim0 13718 . . . . . 6  |-  ( M  e.  ZZ  ->  seq M (  +  , 
( ( ZZ>= `  M
)  X.  { 0 } ) )  ~~>  0 )
1514adantl 473 . . . . 5  |-  ( ( A  C_  ( ZZ>= `  M )  /\  M  e.  ZZ )  ->  seq M (  +  , 
( ( ZZ>= `  M
)  X.  { 0 } ) )  ~~>  0 )
16 funbrfv 5917 . . . . 5  |-  ( Fun  ~~>  ->  (  seq M (  +  ,  ( (
ZZ>= `  M )  X. 
{ 0 } ) )  ~~>  0  ->  (  ~~>  ` 
seq M (  +  ,  ( ( ZZ>= `  M )  X.  {
0 } ) ) )  =  0 ) )
1713, 15, 16mpsyl 64 . . . 4  |-  ( ( A  C_  ( ZZ>= `  M )  /\  M  e.  ZZ )  ->  (  ~~>  ` 
seq M (  +  ,  ( ( ZZ>= `  M )  X.  {
0 } ) ) )  =  0 )
1810, 17eqtrd 2505 . . 3  |-  ( ( A  C_  ( ZZ>= `  M )  /\  M  e.  ZZ )  ->  sum_ k  e.  A  0  = 
0 )
19 uzf 11185 . . . . . . . . 9  |-  ZZ>= : ZZ --> ~P ZZ
2019fdmi 5746 . . . . . . . 8  |-  dom  ZZ>=  =  ZZ
2120eleq2i 2541 . . . . . . 7  |-  ( M  e.  dom  ZZ>=  <->  M  e.  ZZ )
22 ndmfv 5903 . . . . . . 7  |-  ( -.  M  e.  dom  ZZ>=  -> 
( ZZ>= `  M )  =  (/) )
2321, 22sylnbir 314 . . . . . 6  |-  ( -.  M  e.  ZZ  ->  (
ZZ>= `  M )  =  (/) )
2423sseq2d 3446 . . . . 5  |-  ( -.  M  e.  ZZ  ->  ( A  C_  ( ZZ>= `  M )  <->  A  C_  (/) ) )
2524biimpac 494 . . . 4  |-  ( ( A  C_  ( ZZ>= `  M )  /\  -.  M  e.  ZZ )  ->  A  C_  (/) )
26 ss0 3768 . . . 4  |-  ( A 
C_  (/)  ->  A  =  (/) )
27 sumeq1 13832 . . . . 5  |-  ( A  =  (/)  ->  sum_ k  e.  A  0  =  sum_ k  e.  (/)  0 )
28 sum0 13864 . . . . 5  |-  sum_ k  e.  (/)  0  =  0
2927, 28syl6eq 2521 . . . 4  |-  ( A  =  (/)  ->  sum_ k  e.  A  0  = 
0 )
3025, 26, 293syl 18 . . 3  |-  ( ( A  C_  ( ZZ>= `  M )  /\  -.  M  e.  ZZ )  -> 
sum_ k  e.  A 
0  =  0 )
3118, 30pm2.61dan 808 . 2  |-  ( A 
C_  ( ZZ>= `  M
)  ->  sum_ k  e.  A  0  =  0 )
32 fz1f1o 13853 . . 3  |-  ( A  e.  Fin  ->  ( A  =  (/)  \/  (
( # `  A )  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A ) ) )
33 eqidd 2472 . . . . . . . . 9  |-  ( k  =  ( f `  n )  ->  0  =  0 )
34 simpl 464 . . . . . . . . 9  |-  ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  ->  ( # `
 A )  e.  NN )
35 simpr 468 . . . . . . . . 9  |-  ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  ->  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )
36 0cnd 9654 . . . . . . . . 9  |-  ( ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  /\  k  e.  A )  ->  0  e.  CC )
37 elfznn 11854 . . . . . . . . . . 11  |-  ( n  e.  ( 1 ... ( # `  A
) )  ->  n  e.  NN )
384fvconst2 6136 . . . . . . . . . . 11  |-  ( n  e.  NN  ->  (
( NN  X.  {
0 } ) `  n )  =  0 )
3937, 38syl 17 . . . . . . . . . 10  |-  ( n  e.  ( 1 ... ( # `  A
) )  ->  (
( NN  X.  {
0 } ) `  n )  =  0 )
4039adantl 473 . . . . . . . . 9  |-  ( ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  /\  n  e.  ( 1 ... ( # `
 A ) ) )  ->  ( ( NN  X.  { 0 } ) `  n )  =  0 )
4133, 34, 35, 36, 40fsum 13863 . . . . . . . 8  |-  ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  ->  sum_ k  e.  A  0  =  (  seq 1 (  +  ,  ( NN  X.  { 0 } ) ) `  ( # `  A ) ) )
42 nnuz 11218 . . . . . . . . . 10  |-  NN  =  ( ZZ>= `  1 )
4342ser0 12303 . . . . . . . . 9  |-  ( (
# `  A )  e.  NN  ->  (  seq 1 (  +  , 
( NN  X.  {
0 } ) ) `
 ( # `  A
) )  =  0 )
4443adantr 472 . . . . . . . 8  |-  ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  ->  (  seq 1 (  +  , 
( NN  X.  {
0 } ) ) `
 ( # `  A
) )  =  0 )
4541, 44eqtrd 2505 . . . . . . 7  |-  ( ( ( # `  A
)  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )  ->  sum_ k  e.  A  0  = 
0 )
4645ex 441 . . . . . 6  |-  ( (
# `  A )  e.  NN  ->  ( f : ( 1 ... ( # `  A
) ) -1-1-onto-> A  ->  sum_ k  e.  A  0  =  0 ) )
4746exlimdv 1787 . . . . 5  |-  ( (
# `  A )  e.  NN  ->  ( E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A  ->  sum_ k  e.  A  0  =  0 ) )
4847imp 436 . . . 4  |-  ( ( ( # `  A
)  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A )  ->  sum_ k  e.  A 
0  =  0 )
4929, 48jaoi 386 . . 3  |-  ( ( A  =  (/)  \/  (
( # `  A )  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A ) )  ->  sum_ k  e.  A  0  =  0 )
5032, 49syl 17 . 2  |-  ( A  e.  Fin  ->  sum_ k  e.  A  0  = 
0 )
5131, 50jaoi 386 1  |-  ( ( A  C_  ( ZZ>= `  M )  \/  A  e.  Fin )  ->  sum_ k  e.  A  0  = 
0 )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 375    /\ wa 376    = wceq 1452   E.wex 1671    e. wcel 1904    C_ wss 3390   (/)c0 3722   ifcif 3872   ~Pcpw 3942   {csn 3959   class class class wbr 4395    X. cxp 4837   dom cdm 4839   Fun wfun 5583   -->wf 5585   -1-1-onto->wf1o 5588   ` cfv 5589  (class class class)co 6308   Fincfn 7587   CCcc 9555   0cc0 9557   1c1 9558    + caddc 9560   NNcn 10631   ZZcz 10961   ZZ>=cuz 11182   ...cfz 11810    seqcseq 12251   #chash 12553    ~~> cli 13625   sum_csu 13829
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-rep 4508  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602  ax-inf2 8164  ax-cnex 9613  ax-resscn 9614  ax-1cn 9615  ax-icn 9616  ax-addcl 9617  ax-addrcl 9618  ax-mulcl 9619  ax-mulrcl 9620  ax-mulcom 9621  ax-addass 9622  ax-mulass 9623  ax-distr 9624  ax-i2m1 9625  ax-1ne0 9626  ax-1rid 9627  ax-rnegex 9628  ax-rrecex 9629  ax-cnre 9630  ax-pre-lttri 9631  ax-pre-lttrn 9632  ax-pre-ltadd 9633  ax-pre-mulgt0 9634  ax-pre-sup 9635
This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3or 1008  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-nel 2644  df-ral 2761  df-rex 2762  df-reu 2763  df-rmo 2764  df-rab 2765  df-v 3033  df-sbc 3256  df-csb 3350  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-pss 3406  df-nul 3723  df-if 3873  df-pw 3944  df-sn 3960  df-pr 3962  df-tp 3964  df-op 3966  df-uni 4191  df-int 4227  df-iun 4271  df-br 4396  df-opab 4455  df-mpt 4456  df-tr 4491  df-eprel 4750  df-id 4754  df-po 4760  df-so 4761  df-fr 4798  df-se 4799  df-we 4800  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-pred 5387  df-ord 5433  df-on 5434  df-lim 5435  df-suc 5436  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-isom 5598  df-riota 6270  df-ov 6311  df-oprab 6312  df-mpt2 6313  df-om 6712  df-1st 6812  df-2nd 6813  df-wrecs 7046  df-recs 7108  df-rdg 7146  df-1o 7200  df-oadd 7204  df-er 7381  df-en 7588  df-dom 7589  df-sdom 7590  df-fin 7591  df-sup 7974  df-oi 8043  df-card 8391  df-pnf 9695  df-mnf 9696  df-xr 9697  df-ltxr 9698  df-le 9699  df-sub 9882  df-neg 9883  df-div 10292  df-nn 10632  df-2 10690  df-3 10691  df-n0 10894  df-z 10962  df-uz 11183  df-rp 11326  df-fz 11811  df-fzo 11943  df-seq 12252  df-exp 12311  df-hash 12554  df-cj 13239  df-re 13240  df-im 13241  df-sqrt 13375  df-abs 13376  df-clim 13629  df-sum 13830
This theorem is referenced by:  fsum00  13935  fsumdvds  14425  pcfac  14923  ovoliunnul  22538  vitalilem5  22649  itg1addlem5  22737  itg10a  22747  itg0  22816  itgz  22817  plymullem1  23247  coemullem  23283  logtayl  23684  ftalem5  24080  ftalem5OLD  24082  chp1  24173  logexprlim  24232  bposlem2  24292  rpvmasumlem  24404  axcgrid  25025  axlowdimlem16  25066  plymulx0  29508  signsplypnf  29511  volsupnfl  32049  binomcxplemnn0  36768  binomcxplemnotnn0  36775  sumnnodd  37807  stoweidlem37  38010  fourierdlem103  38185  fourierdlem104  38186  etransclem24  38235  etransclem32  38243  etransclem35  38246  sge0z  38331  aacllem  41046
  Copyright terms: Public domain W3C validator