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

Theorem isumadd 12223
Description: Addition of infinite sums. (Contributed by Mario Carneiro, 18-Aug-2013.) (Revised by Mario Carneiro, 23-Apr-2014.)
Hypotheses
Ref Expression
isumadd.1  |-  Z  =  ( ZZ>= `  M )
isumadd.2  |-  ( ph  ->  M  e.  ZZ )
isumadd.3  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  =  A )
isumadd.4  |-  ( (
ph  /\  k  e.  Z )  ->  A  e.  CC )
isumadd.5  |-  ( (
ph  /\  k  e.  Z )  ->  ( G `  k )  =  B )
isumadd.6  |-  ( (
ph  /\  k  e.  Z )  ->  B  e.  CC )
isumadd.7  |-  ( ph  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
isumadd.8  |-  ( ph  ->  seq M (  +  ,  G )  e. 
dom 
~~>  )
Assertion
Ref Expression
isumadd  |-  ( ph  -> 
sum_ k  e.  Z  ( A  +  B
)  =  ( sum_ k  e.  Z  A  +  sum_ k  e.  Z  B ) )
Distinct variable groups:    k, F    k, G    k, M    ph, k    k, Z
Allowed substitution hints:    A( k)    B( k)

Proof of Theorem isumadd
Dummy variables  j  m are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isumadd.1 . 2  |-  Z  =  ( ZZ>= `  M )
2 isumadd.2 . 2  |-  ( ph  ->  M  e.  ZZ )
3 simpr 110 . . . 4  |-  ( (
ph  /\  k  e.  Z )  ->  k  e.  Z )
4 isumadd.3 . . . . . 6  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  =  A )
5 isumadd.4 . . . . . 6  |-  ( (
ph  /\  k  e.  Z )  ->  A  e.  CC )
64, 5eqeltrd 2315 . . . . 5  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  CC )
7 isumadd.5 . . . . . 6  |-  ( (
ph  /\  k  e.  Z )  ->  ( G `  k )  =  B )
8 isumadd.6 . . . . . 6  |-  ( (
ph  /\  k  e.  Z )  ->  B  e.  CC )
97, 8eqeltrd 2315 . . . . 5  |-  ( (
ph  /\  k  e.  Z )  ->  ( G `  k )  e.  CC )
106, 9addcld 8351 . . . 4  |-  ( (
ph  /\  k  e.  Z )  ->  (
( F `  k
)  +  ( G `
 k ) )  e.  CC )
11 fveq2 5698 . . . . . 6  |-  ( m  =  k  ->  ( F `  m )  =  ( F `  k ) )
12 fveq2 5698 . . . . . 6  |-  ( m  =  k  ->  ( G `  m )  =  ( G `  k ) )
1311, 12oveq12d 6106 . . . . 5  |-  ( m  =  k  ->  (
( F `  m
)  +  ( G `
 m ) )  =  ( ( F `
 k )  +  ( G `  k
) ) )
14 eqid 2238 . . . . 5  |-  ( m  e.  Z  |->  ( ( F `  m )  +  ( G `  m ) ) )  =  ( m  e.  Z  |->  ( ( F `
 m )  +  ( G `  m
) ) )
1513, 14fvmptg 5784 . . . 4  |-  ( ( k  e.  Z  /\  ( ( F `  k )  +  ( G `  k ) )  e.  CC )  ->  ( ( m  e.  Z  |->  ( ( F `  m )  +  ( G `  m ) ) ) `
 k )  =  ( ( F `  k )  +  ( G `  k ) ) )
163, 10, 15syl2anc 415 . . 3  |-  ( (
ph  /\  k  e.  Z )  ->  (
( m  e.  Z  |->  ( ( F `  m )  +  ( G `  m ) ) ) `  k
)  =  ( ( F `  k )  +  ( G `  k ) ) )
174, 7oveq12d 6106 . . 3  |-  ( (
ph  /\  k  e.  Z )  ->  (
( F `  k
)  +  ( G `
 k ) )  =  ( A  +  B ) )
1816, 17eqtrd 2271 . 2  |-  ( (
ph  /\  k  e.  Z )  ->  (
( m  e.  Z  |->  ( ( F `  m )  +  ( G `  m ) ) ) `  k
)  =  ( A  +  B ) )
195, 8addcld 8351 . 2  |-  ( (
ph  /\  k  e.  Z )  ->  ( A  +  B )  e.  CC )
20 isumadd.7 . . . 4  |-  ( ph  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
211, 2, 4, 5, 20isumclim2 12214 . . 3  |-  ( ph  ->  seq M (  +  ,  F )  ~~>  sum_ k  e.  Z  A )
22 seqex 10907 . . . 4  |-  seq M
(  +  ,  ( m  e.  Z  |->  ( ( F `  m
)  +  ( G `
 m ) ) ) )  e.  _V
2322a1i 9 . . 3  |-  ( ph  ->  seq M (  +  ,  ( m  e.  Z  |->  ( ( F `
 m )  +  ( G `  m
) ) ) )  e.  _V )
24 isumadd.8 . . . 4  |-  ( ph  ->  seq M (  +  ,  G )  e. 
dom 
~~>  )
251, 2, 7, 8, 24isumclim2 12214 . . 3  |-  ( ph  ->  seq M (  +  ,  G )  ~~>  sum_ k  e.  Z  B )
261, 2, 6serf 10941 . . . 4  |-  ( ph  ->  seq M (  +  ,  F ) : Z --> CC )
2726ffvelcdmda 5846 . . 3  |-  ( (
ph  /\  j  e.  Z )  ->  (  seq M (  +  ,  F ) `  j
)  e.  CC )
281, 2, 9serf 10941 . . . 4  |-  ( ph  ->  seq M (  +  ,  G ) : Z --> CC )
2928ffvelcdmda 5846 . . 3  |-  ( (
ph  /\  j  e.  Z )  ->  (  seq M (  +  ,  G ) `  j
)  e.  CC )
30 simpr 110 . . . . 5  |-  ( (
ph  /\  j  e.  Z )  ->  j  e.  Z )
3130, 1eleqtrdi 2331 . . . 4  |-  ( (
ph  /\  j  e.  Z )  ->  j  e.  ( ZZ>= `  M )
)
32 simpll 531 . . . . 5  |-  ( ( ( ph  /\  j  e.  Z )  /\  k  e.  ( ZZ>= `  M )
)  ->  ph )
331eleq2i 2305 . . . . . . 7  |-  ( k  e.  Z  <->  k  e.  ( ZZ>= `  M )
)
3433biimpri 133 . . . . . 6  |-  ( k  e.  ( ZZ>= `  M
)  ->  k  e.  Z )
3534adantl 277 . . . . 5  |-  ( ( ( ph  /\  j  e.  Z )  /\  k  e.  ( ZZ>= `  M )
)  ->  k  e.  Z )
3632, 35, 6syl2anc 415 . . . 4  |-  ( ( ( ph  /\  j  e.  Z )  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  e.  CC )
3732, 35, 9syl2anc 415 . . . 4  |-  ( ( ( ph  /\  j  e.  Z )  /\  k  e.  ( ZZ>= `  M )
)  ->  ( G `  k )  e.  CC )
3832, 35, 10syl2anc 415 . . . . 5  |-  ( ( ( ph  /\  j  e.  Z )  /\  k  e.  ( ZZ>= `  M )
)  ->  ( ( F `  k )  +  ( G `  k ) )  e.  CC )
3935, 38, 15syl2anc 415 . . . 4  |-  ( ( ( ph  /\  j  e.  Z )  /\  k  e.  ( ZZ>= `  M )
)  ->  ( (
m  e.  Z  |->  ( ( F `  m
)  +  ( G `
 m ) ) ) `  k )  =  ( ( F `
 k )  +  ( G `  k
) ) )
4031, 36, 37, 39ser3add 10980 . . 3  |-  ( (
ph  /\  j  e.  Z )  ->  (  seq M (  +  , 
( m  e.  Z  |->  ( ( F `  m )  +  ( G `  m ) ) ) ) `  j )  =  ( (  seq M (  +  ,  F ) `
 j )  +  (  seq M (  +  ,  G ) `
 j ) ) )
411, 2, 21, 23, 25, 27, 29, 40climadd 12117 . 2  |-  ( ph  ->  seq M (  +  ,  ( m  e.  Z  |->  ( ( F `
 m )  +  ( G `  m
) ) ) )  ~~>  ( sum_ k  e.  Z  A  +  sum_ k  e.  Z  B ) )
421, 2, 18, 19, 41isumclim 12213 1  |-  ( ph  -> 
sum_ k  e.  Z  ( A  +  B
)  =  ( sum_ k  e.  Z  A  +  sum_ k  e.  Z  B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    |-> cmpt 4193   dom cdm 4776   ` cfv 5380  (class class class)co 6088   CCcc 8183    + caddc 8188   ZZcz 9655   ZZ>=cuz 9937    seqcseq 10905    ~~> cli 12069   sum_csu 12144
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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-oadd 6695  df-er 6811  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fzo 10567  df-seqfrec 10906  df-exp 10997  df-ihash 11237  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-clim 12070  df-sumdc 12145
This theorem is used by:  sumsplitdc  12224
  Copyright terms: Public domain W3C validator