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

Theorem fsumconst 13844
Description: The sum of constant terms ( k is not free in  A). (Contributed by NM, 24-Dec-2005.) (Revised by Mario Carneiro, 24-Apr-2014.)
Assertion
Ref Expression
fsumconst  |-  ( ( A  e.  Fin  /\  B  e.  CC )  -> 
sum_ k  e.  A  B  =  ( ( # `
 A )  x.  B ) )
Distinct variable groups:    A, k    B, k

Proof of Theorem fsumconst
Dummy variables  f  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mul02 9813 . . . . 5  |-  ( B  e.  CC  ->  (
0  x.  B )  =  0 )
21adantl 468 . . . 4  |-  ( ( A  e.  Fin  /\  B  e.  CC )  ->  ( 0  x.  B
)  =  0 )
32eqcomd 2431 . . 3  |-  ( ( A  e.  Fin  /\  B  e.  CC )  ->  0  =  ( 0  x.  B ) )
4 sumeq1 13748 . . . . 5  |-  ( A  =  (/)  ->  sum_ k  e.  A  B  =  sum_ k  e.  (/)  B )
5 sum0 13780 . . . . 5  |-  sum_ k  e.  (/)  B  =  0
64, 5syl6eq 2480 . . . 4  |-  ( A  =  (/)  ->  sum_ k  e.  A  B  = 
0 )
7 fveq2 5879 . . . . . 6  |-  ( A  =  (/)  ->  ( # `  A )  =  (
# `  (/) ) )
8 hash0 12549 . . . . . 6  |-  ( # `  (/) )  =  0
97, 8syl6eq 2480 . . . . 5  |-  ( A  =  (/)  ->  ( # `  A )  =  0 )
109oveq1d 6318 . . . 4  |-  ( A  =  (/)  ->  ( (
# `  A )  x.  B )  =  ( 0  x.  B ) )
116, 10eqeq12d 2445 . . 3  |-  ( A  =  (/)  ->  ( sum_ k  e.  A  B  =  ( ( # `  A )  x.  B
)  <->  0  =  ( 0  x.  B ) ) )
123, 11syl5ibrcom 226 . 2  |-  ( ( A  e.  Fin  /\  B  e.  CC )  ->  ( A  =  (/)  -> 
sum_ k  e.  A  B  =  ( ( # `
 A )  x.  B ) ) )
13 eqidd 2424 . . . . . . 7  |-  ( k  =  ( f `  n )  ->  B  =  B )
14 simprl 763 . . . . . . 7  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( ( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  -> 
( # `  A )  e.  NN )
15 simprr 765 . . . . . . 7  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( ( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  -> 
f : ( 1 ... ( # `  A
) ) -1-1-onto-> A )
16 simpllr 768 . . . . . . 7  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  CC )  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  k  e.  A )  ->  B  e.  CC )
17 simplr 761 . . . . . . . 8  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( ( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  ->  B  e.  CC )
18 elfznn 11830 . . . . . . . 8  |-  ( n  e.  ( 1 ... ( # `  A
) )  ->  n  e.  NN )
19 fvconst2g 6131 . . . . . . . 8  |-  ( ( B  e.  CC  /\  n  e.  NN )  ->  ( ( NN  X.  { B } ) `  n )  =  B )
2017, 18, 19syl2an 480 . . . . . . 7  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  CC )  /\  (
( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  /\  n  e.  ( 1 ... ( # `  A
) ) )  -> 
( ( NN  X.  { B } ) `  n )  =  B )
2113, 14, 15, 16, 20fsum 13779 . . . . . 6  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( ( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  ->  sum_ k  e.  A  B  =  (  seq 1
(  +  ,  ( NN  X.  { B } ) ) `  ( # `  A ) ) )
22 ser1const 12270 . . . . . . 7  |-  ( ( B  e.  CC  /\  ( # `  A )  e.  NN )  -> 
(  seq 1 (  +  ,  ( NN  X.  { B } ) ) `
 ( # `  A
) )  =  ( ( # `  A
)  x.  B ) )
2322ad2ant2lr 753 . . . . . 6  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( ( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  -> 
(  seq 1 (  +  ,  ( NN  X.  { B } ) ) `
 ( # `  A
) )  =  ( ( # `  A
)  x.  B ) )
2421, 23eqtrd 2464 . . . . 5  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( ( # `  A )  e.  NN  /\  f : ( 1 ... ( # `  A
) ) -1-1-onto-> A ) )  ->  sum_ k  e.  A  B  =  ( ( # `  A )  x.  B
) )
2524expr 619 . . . 4  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( # `  A
)  e.  NN )  ->  ( f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A  ->  sum_ k  e.  A  B  =  ( ( # `
 A )  x.  B ) ) )
2625exlimdv 1769 . . 3  |-  ( ( ( A  e.  Fin  /\  B  e.  CC )  /\  ( # `  A
)  e.  NN )  ->  ( E. f 
f : ( 1 ... ( # `  A
) ) -1-1-onto-> A  ->  sum_ k  e.  A  B  =  ( ( # `  A
)  x.  B ) ) )
2726expimpd 607 . 2  |-  ( ( A  e.  Fin  /\  B  e.  CC )  ->  ( ( ( # `  A )  e.  NN  /\ 
E. f  f : ( 1 ... ( # `
 A ) ) -1-1-onto-> A )  ->  sum_ k  e.  A  B  =  ( ( # `  A
)  x.  B ) ) )
28 fz1f1o 13769 . . 3  |-  ( A  e.  Fin  ->  ( A  =  (/)  \/  (
( # `  A )  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A ) ) )
2928adantr 467 . 2  |-  ( ( A  e.  Fin  /\  B  e.  CC )  ->  ( A  =  (/)  \/  ( ( # `  A
)  e.  NN  /\  E. f  f : ( 1 ... ( # `  A ) ) -1-1-onto-> A ) ) )
3012, 27, 29mpjaod 383 1  |-  ( ( A  e.  Fin  /\  B  e.  CC )  -> 
sum_ k  e.  A  B  =  ( ( # `
 A )  x.  B ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 370    /\ wa 371    = wceq 1438   E.wex 1660    e. wcel 1869   (/)c0 3762   {csn 3997    X. cxp 4849   -1-1-onto->wf1o 5598   ` cfv 5599  (class class class)co 6303   Fincfn 7575   CCcc 9539   0cc0 9541   1c1 9542    + caddc 9544    x. cmul 9546   NNcn 10611   ...cfz 11786    seqcseq 12214   #chash 12516   sum_csu 13745
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-8 1871  ax-9 1873  ax-10 1888  ax-11 1893  ax-12 1906  ax-13 2054  ax-ext 2401  ax-rep 4534  ax-sep 4544  ax-nul 4553  ax-pow 4600  ax-pr 4658  ax-un 6595  ax-inf2 8150  ax-cnex 9597  ax-resscn 9598  ax-1cn 9599  ax-icn 9600  ax-addcl 9601  ax-addrcl 9602  ax-mulcl 9603  ax-mulrcl 9604  ax-mulcom 9605  ax-addass 9606  ax-mulass 9607  ax-distr 9608  ax-i2m1 9609  ax-1ne0 9610  ax-1rid 9611  ax-rnegex 9612  ax-rrecex 9613  ax-cnre 9614  ax-pre-lttri 9615  ax-pre-lttrn 9616  ax-pre-ltadd 9617  ax-pre-mulgt0 9618  ax-pre-sup 9619
This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3or 984  df-3an 985  df-tru 1441  df-ex 1661  df-nf 1665  df-sb 1788  df-eu 2270  df-mo 2271  df-clab 2409  df-cleq 2415  df-clel 2418  df-nfc 2573  df-ne 2621  df-nel 2622  df-ral 2781  df-rex 2782  df-reu 2783  df-rmo 2784  df-rab 2785  df-v 3084  df-sbc 3301  df-csb 3397  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-pss 3453  df-nul 3763  df-if 3911  df-pw 3982  df-sn 3998  df-pr 4000  df-tp 4002  df-op 4004  df-uni 4218  df-int 4254  df-iun 4299  df-br 4422  df-opab 4481  df-mpt 4482  df-tr 4517  df-eprel 4762  df-id 4766  df-po 4772  df-so 4773  df-fr 4810  df-se 4811  df-we 4812  df-xp 4857  df-rel 4858  df-cnv 4859  df-co 4860  df-dm 4861  df-rn 4862  df-res 4863  df-ima 4864  df-pred 5397  df-ord 5443  df-on 5444  df-lim 5445  df-suc 5446  df-iota 5563  df-fun 5601  df-fn 5602  df-f 5603  df-f1 5604  df-fo 5605  df-f1o 5606  df-fv 5607  df-isom 5608  df-riota 6265  df-ov 6306  df-oprab 6307  df-mpt2 6308  df-om 6705  df-1st 6805  df-2nd 6806  df-wrecs 7034  df-recs 7096  df-rdg 7134  df-1o 7188  df-oadd 7192  df-er 7369  df-en 7576  df-dom 7577  df-sdom 7578  df-fin 7579  df-sup 7960  df-oi 8029  df-card 8376  df-pnf 9679  df-mnf 9680  df-xr 9681  df-ltxr 9682  df-le 9683  df-sub 9864  df-neg 9865  df-div 10272  df-nn 10612  df-2 10670  df-3 10671  df-n0 10872  df-z 10940  df-uz 11162  df-rp 11305  df-fz 11787  df-fzo 11918  df-seq 12215  df-exp 12274  df-hash 12517  df-cj 13156  df-re 13157  df-im 13158  df-sqrt 13292  df-abs 13293  df-clim 13545  df-sum 13746
This theorem is referenced by:  o1fsum  13866  hashiun  13875  climcndslem1  13900  climcndslem2  13901  harmonic  13910  mertenslem1  13933  sumhash  14834  cshwshashnsame  15067  lagsubg2  16871  sylow2a  17264  lebnumlem3  21983  lebnumlem3OLD  21986  uniioombllem4  22536  birthdaylem2  23870  basellem8  24006  0sgm  24063  musum  24112  chtleppi  24130  vmasum  24136  logfac2  24137  chpval2  24138  chpchtsum  24139  chpub  24140  logfaclbnd  24142  dchrsum2  24188  sumdchr2  24190  lgsquadlem1  24274  chebbnd1lem1  24299  chtppilimlem1  24303  dchrmusum2  24324  dchrisum0flblem1  24338  rpvmasum2  24342  dchrisum0lem2a  24347  mudivsum  24360  mulogsumlem  24361  selberglem2  24376  pntlemj  24433  hashclwwlkn  25556  rusgranumwlks  25676  frghash2spot  25783  usgreghash2spotv  25786  usgreghash2spot  25789  numclwwlk6  25833  rrndstprj2  32083  stoweidlem11  37697  stoweidlem26  37712  stoweidlem38  37725  dirkertrigeq  37789  fourierdlem73  37869  etransclem32  37957  sge0rpcpnf  38057  nn0mulfsum  39741
  Copyright terms: Public domain W3C validator