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

Theorem isumrpcl 11516
Description: The infinite sum of positive reals is positive. (Contributed by Paul Chapman, 9-Feb-2008.) (Revised by Mario Carneiro, 24-Apr-2014.)
Hypotheses
Ref Expression
isumrpcl.1  |-  Z  =  ( ZZ>= `  M )
isumrpcl.2  |-  W  =  ( ZZ>= `  N )
isumrpcl.3  |-  ( ph  ->  N  e.  Z )
isumrpcl.4  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  =  A )
isumrpcl.5  |-  ( (
ph  /\  k  e.  Z )  ->  A  e.  RR+ )
isumrpcl.6  |-  ( ph  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
Assertion
Ref Expression
isumrpcl  |-  ( ph  -> 
sum_ k  e.  W  A  e.  RR+ )
Distinct variable groups:    k, F    k, M    k, N    ph, k    k, W    k, Z
Allowed substitution hint:    A( k)

Proof of Theorem isumrpcl
Dummy variables  m  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isumrpcl.2 . . 3  |-  W  =  ( ZZ>= `  N )
2 isumrpcl.3 . . . . 5  |-  ( ph  ->  N  e.  Z )
3 isumrpcl.1 . . . . 5  |-  Z  =  ( ZZ>= `  M )
42, 3eleqtrdi 2280 . . . 4  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
5 eluzelz 9551 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
64, 5syl 14 . . 3  |-  ( ph  ->  N  e.  ZZ )
7 uzss 9562 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( ZZ>= `  N )  C_  ( ZZ>=
`  M ) )
84, 7syl 14 . . . . . 6  |-  ( ph  ->  ( ZZ>= `  N )  C_  ( ZZ>= `  M )
)
98, 1, 33sstr4g 3210 . . . . 5  |-  ( ph  ->  W  C_  Z )
109sselda 3167 . . . 4  |-  ( (
ph  /\  k  e.  W )  ->  k  e.  Z )
11 isumrpcl.4 . . . 4  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  =  A )
1210, 11syldan 282 . . 3  |-  ( (
ph  /\  k  e.  W )  ->  ( F `  k )  =  A )
13 isumrpcl.5 . . . . 5  |-  ( (
ph  /\  k  e.  Z )  ->  A  e.  RR+ )
1413rpred 9710 . . . 4  |-  ( (
ph  /\  k  e.  Z )  ->  A  e.  RR )
1510, 14syldan 282 . . 3  |-  ( (
ph  /\  k  e.  W )  ->  A  e.  RR )
16 isumrpcl.6 . . . 4  |-  ( ph  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
1711, 13eqeltrd 2264 . . . . . 6  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  RR+ )
1817rpcnd 9712 . . . . 5  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  CC )
193, 2, 18iserex 11361 . . . 4  |-  ( ph  ->  (  seq M (  +  ,  F )  e.  dom  ~~>  <->  seq N (  +  ,  F )  e.  dom  ~~>  ) )
2016, 19mpbid 147 . . 3  |-  ( ph  ->  seq N (  +  ,  F )  e. 
dom 
~~>  )
211, 6, 12, 15, 20isumrecl 11451 . 2  |-  ( ph  -> 
sum_ k  e.  W  A  e.  RR )
22 fveq2 5527 . . . 4  |-  ( k  =  N  ->  ( F `  k )  =  ( F `  N ) )
2322eleq1d 2256 . . 3  |-  ( k  =  N  ->  (
( F `  k
)  e.  RR+  <->  ( F `  N )  e.  RR+ ) )
2417ralrimiva 2560 . . 3  |-  ( ph  ->  A. k  e.  Z  ( F `  k )  e.  RR+ )
2523, 24, 2rspcdva 2858 . 2  |-  ( ph  ->  ( F `  N
)  e.  RR+ )
268sselda 3167 . . . . . 6  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  ->  k  e.  ( ZZ>= `  M )
)
2726, 3eleqtrrdi 2281 . . . . 5  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  ->  k  e.  Z )
2827, 17syldan 282 . . . 4  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  ->  ( F `  k )  e.  RR+ )
29 rpaddcl 9691 . . . . 5  |-  ( ( k  e.  RR+  /\  y  e.  RR+ )  ->  (
k  +  y )  e.  RR+ )
3029adantl 277 . . . 4  |-  ( (
ph  /\  ( k  e.  RR+  /\  y  e.  RR+ ) )  ->  (
k  +  y )  e.  RR+ )
316, 28, 30seq3-1 10474 . . 3  |-  ( ph  ->  (  seq N (  +  ,  F ) `
 N )  =  ( F `  N
) )
32 uzid 9556 . . . . . 6  |-  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  N )
)
336, 32syl 14 . . . . 5  |-  ( ph  ->  N  e.  ( ZZ>= `  N ) )
3433, 1eleqtrrdi 2281 . . . 4  |-  ( ph  ->  N  e.  W )
3515recnd 8000 . . . . 5  |-  ( (
ph  /\  k  e.  W )  ->  A  e.  CC )
361, 6, 12, 35, 20isumclim2 11444 . . . 4  |-  ( ph  ->  seq N (  +  ,  F )  ~~>  sum_ k  e.  W  A )
379sseld 3166 . . . . . . 7  |-  ( ph  ->  ( m  e.  W  ->  m  e.  Z ) )
38 fveq2 5527 . . . . . . . . 9  |-  ( k  =  m  ->  ( F `  k )  =  ( F `  m ) )
3938eleq1d 2256 . . . . . . . 8  |-  ( k  =  m  ->  (
( F `  k
)  e.  RR+  <->  ( F `  m )  e.  RR+ ) )
4039rspcv 2849 . . . . . . 7  |-  ( m  e.  Z  ->  ( A. k  e.  Z  ( F `  k )  e.  RR+  ->  ( F `
 m )  e.  RR+ ) )
4137, 24, 40syl6ci 1455 . . . . . 6  |-  ( ph  ->  ( m  e.  W  ->  ( F `  m
)  e.  RR+ )
)
4241imp 124 . . . . 5  |-  ( (
ph  /\  m  e.  W )  ->  ( F `  m )  e.  RR+ )
4342rpred 9710 . . . 4  |-  ( (
ph  /\  m  e.  W )  ->  ( F `  m )  e.  RR )
4442rpge0d 9714 . . . 4  |-  ( (
ph  /\  m  e.  W )  ->  0  <_  ( F `  m
) )
451, 34, 36, 43, 44climserle 11367 . . 3  |-  ( ph  ->  (  seq N (  +  ,  F ) `
 N )  <_  sum_ k  e.  W  A
)
4631, 45eqbrtrrd 4039 . 2  |-  ( ph  ->  ( F `  N
)  <_  sum_ k  e.  W  A )
4721, 25, 46rpgecld 9750 1  |-  ( ph  -> 
sum_ k  e.  W  A  e.  RR+ )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1363    e. wcel 2158   A.wral 2465    C_ wss 3141   dom cdm 4638   ` cfv 5228  (class class class)co 5888   RRcr 7824    + caddc 7828    <_ cle 8007   ZZcz 9267   ZZ>=cuz 9542   RR+crp 9667    seqcseq 10459    ~~> cli 11300   sum_csu 11375
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599  ax-cnex 7916  ax-resscn 7917  ax-1cn 7918  ax-1re 7919  ax-icn 7920  ax-addcl 7921  ax-addrcl 7922  ax-mulcl 7923  ax-mulrcl 7924  ax-addcom 7925  ax-mulcom 7926  ax-addass 7927  ax-mulass 7928  ax-distr 7929  ax-i2m1 7930  ax-0lt1 7931  ax-1rid 7932  ax-0id 7933  ax-rnegex 7934  ax-precex 7935  ax-cnre 7936  ax-pre-ltirr 7937  ax-pre-ltwlin 7938  ax-pre-lttrn 7939  ax-pre-apti 7940  ax-pre-ltadd 7941  ax-pre-mulgt0 7942  ax-pre-mulext 7943  ax-arch 7944  ax-caucvg 7945
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rmo 2473  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-if 3547  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-po 4308  df-iso 4309  df-iord 4378  df-on 4380  df-ilim 4381  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-isom 5237  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6155  df-2nd 6156  df-recs 6320  df-irdg 6385  df-frec 6406  df-1o 6431  df-oadd 6435  df-er 6549  df-en 6755  df-dom 6756  df-fin 6757  df-pnf 8008  df-mnf 8009  df-xr 8010  df-ltxr 8011  df-le 8012  df-sub 8144  df-neg 8145  df-reap 8546  df-ap 8553  df-div 8644  df-inn 8934  df-2 8992  df-3 8993  df-4 8994  df-n0 9191  df-z 9268  df-uz 9543  df-q 9634  df-rp 9668  df-fz 10023  df-fzo 10157  df-seqfrec 10460  df-exp 10534  df-ihash 10770  df-cj 10865  df-re 10866  df-im 10867  df-rsqrt 11021  df-abs 11022  df-clim 11301  df-sumdc 11376
This theorem is referenced by:  effsumlt  11714  eirraplem  11798
  Copyright terms: Public domain W3C validator