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

Theorem ser3mono 10403
Description: The partial sums in an infinite series of positive terms form a monotonic sequence. (Contributed by NM, 17-Mar-2005.) (Revised by Jim Kingdon, 22-Apr-2023.)
Hypotheses
Ref Expression
sermono.1  |-  ( ph  ->  K  e.  ( ZZ>= `  M ) )
sermono.2  |-  ( ph  ->  N  e.  ( ZZ>= `  K ) )
ser3mono.3  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  RR )
sermono.4  |-  ( (
ph  /\  x  e.  ( ( K  + 
1 ) ... N
) )  ->  0  <_  ( F `  x
) )
Assertion
Ref Expression
ser3mono  |-  ( ph  ->  (  seq M (  +  ,  F ) `
 K )  <_ 
(  seq M (  +  ,  F ) `  N ) )
Distinct variable groups:    x, F    x, K    x, M    x, N    ph, x

Proof of Theorem ser3mono
Dummy variables  k  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sermono.2 . 2  |-  ( ph  ->  N  e.  ( ZZ>= `  K ) )
2 eqid 2164 . . . 4  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
3 sermono.1 . . . . . 6  |-  ( ph  ->  K  e.  ( ZZ>= `  M ) )
4 eluzel2 9462 . . . . . 6  |-  ( K  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
53, 4syl 14 . . . . 5  |-  ( ph  ->  M  e.  ZZ )
65adantr 274 . . . 4  |-  ( (
ph  /\  k  e.  ( K ... N ) )  ->  M  e.  ZZ )
7 ser3mono.3 . . . . 5  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  RR )
87adantlr 469 . . . 4  |-  ( ( ( ph  /\  k  e.  ( K ... N
) )  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  RR )
92, 6, 8serfre 10400 . . 3  |-  ( (
ph  /\  k  e.  ( K ... N ) )  ->  seq M (  +  ,  F ) : ( ZZ>= `  M
) --> RR )
10 elfzuz 9947 . . . 4  |-  ( k  e.  ( K ... N )  ->  k  e.  ( ZZ>= `  K )
)
11 uztrn 9473 . . . 4  |-  ( ( k  e.  ( ZZ>= `  K )  /\  K  e.  ( ZZ>= `  M )
)  ->  k  e.  ( ZZ>= `  M )
)
1210, 3, 11syl2anr 288 . . 3  |-  ( (
ph  /\  k  e.  ( K ... N ) )  ->  k  e.  ( ZZ>= `  M )
)
139, 12ffvelrnd 5615 . 2  |-  ( (
ph  /\  k  e.  ( K ... N ) )  ->  (  seq M (  +  ,  F ) `  k
)  e.  RR )
14 fveq2 5480 . . . . . 6  |-  ( x  =  ( k  +  1 )  ->  ( F `  x )  =  ( F `  ( k  +  1 ) ) )
1514breq2d 3988 . . . . 5  |-  ( x  =  ( k  +  1 )  ->  (
0  <_  ( F `  x )  <->  0  <_  ( F `  ( k  +  1 ) ) ) )
16 sermono.4 . . . . . . 7  |-  ( (
ph  /\  x  e.  ( ( K  + 
1 ) ... N
) )  ->  0  <_  ( F `  x
) )
1716ralrimiva 2537 . . . . . 6  |-  ( ph  ->  A. x  e.  ( ( K  +  1 ) ... N ) 0  <_  ( F `  x ) )
1817adantr 274 . . . . 5  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  A. x  e.  ( ( K  + 
1 ) ... N
) 0  <_  ( F `  x )
)
19 simpr 109 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  k  e.  ( K ... ( N  -  1 ) ) )
203adantr 274 . . . . . . . . 9  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  K  e.  ( ZZ>= `  M )
)
21 eluzelz 9466 . . . . . . . . 9  |-  ( K  e.  ( ZZ>= `  M
)  ->  K  e.  ZZ )
2220, 21syl 14 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  K  e.  ZZ )
231adantr 274 . . . . . . . . . 10  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  N  e.  ( ZZ>= `  K )
)
24 eluzelz 9466 . . . . . . . . . 10  |-  ( N  e.  ( ZZ>= `  K
)  ->  N  e.  ZZ )
2523, 24syl 14 . . . . . . . . 9  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  N  e.  ZZ )
26 peano2zm 9220 . . . . . . . . 9  |-  ( N  e.  ZZ  ->  ( N  -  1 )  e.  ZZ )
2725, 26syl 14 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( N  -  1 )  e.  ZZ )
28 elfzelz 9951 . . . . . . . . 9  |-  ( k  e.  ( K ... ( N  -  1
) )  ->  k  e.  ZZ )
2928adantl 275 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  k  e.  ZZ )
30 1zzd 9209 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  1  e.  ZZ )
31 fzaddel 9984 . . . . . . . 8  |-  ( ( ( K  e.  ZZ  /\  ( N  -  1 )  e.  ZZ )  /\  ( k  e.  ZZ  /\  1  e.  ZZ ) )  -> 
( k  e.  ( K ... ( N  -  1 ) )  <-> 
( k  +  1 )  e.  ( ( K  +  1 ) ... ( ( N  -  1 )  +  1 ) ) ) )
3222, 27, 29, 30, 31syl22anc 1228 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  e.  ( K ... ( N  -  1 ) )  <->  ( k  +  1 )  e.  ( ( K  +  1 ) ... ( ( N  -  1 )  +  1 ) ) ) )
3319, 32mpbid 146 . . . . . 6  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( ( K  + 
1 ) ... (
( N  -  1 )  +  1 ) ) )
34 zcn 9187 . . . . . . . . 9  |-  ( N  e.  ZZ  ->  N  e.  CC )
35 ax-1cn 7837 . . . . . . . . 9  |-  1  e.  CC
36 npcan 8098 . . . . . . . . 9  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
3734, 35, 36sylancl 410 . . . . . . . 8  |-  ( N  e.  ZZ  ->  (
( N  -  1 )  +  1 )  =  N )
3825, 37syl 14 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( ( N  -  1 )  +  1 )  =  N )
3938oveq2d 5852 . . . . . 6  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( ( K  +  1 ) ... ( ( N  -  1 )  +  1 ) )  =  ( ( K  + 
1 ) ... N
) )
4033, 39eleqtrd 2243 . . . . 5  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( ( K  + 
1 ) ... N
) )
4115, 18, 40rspcdva 2830 . . . 4  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  0  <_  ( F `  ( k  +  1 ) ) )
42 fzelp1 9999 . . . . . . . 8  |-  ( k  e.  ( K ... ( N  -  1
) )  ->  k  e.  ( K ... (
( N  -  1 )  +  1 ) ) )
4342adantl 275 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  k  e.  ( K ... ( ( N  -  1 )  +  1 ) ) )
4438oveq2d 5852 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( K ... ( ( N  - 
1 )  +  1 ) )  =  ( K ... N ) )
4543, 44eleqtrd 2243 . . . . . 6  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  k  e.  ( K ... N ) )
4645, 13syldan 280 . . . . 5  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  (  seq M (  +  ,  F ) `  k
)  e.  RR )
4714eleq1d 2233 . . . . . 6  |-  ( x  =  ( k  +  1 )  ->  (
( F `  x
)  e.  RR  <->  ( F `  ( k  +  1 ) )  e.  RR ) )
487ralrimiva 2537 . . . . . . 7  |-  ( ph  ->  A. x  e.  (
ZZ>= `  M ) ( F `  x )  e.  RR )
4948adantr 274 . . . . . 6  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  A. x  e.  ( ZZ>= `  M )
( F `  x
)  e.  RR )
50 fzss1 9988 . . . . . . . . 9  |-  ( K  e.  ( ZZ>= `  M
)  ->  ( K ... N )  C_  ( M ... N ) )
5120, 50syl 14 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( K ... N )  C_  ( M ... N ) )
52 fzp1elp1 10000 . . . . . . . . . 10  |-  ( k  e.  ( K ... ( N  -  1
) )  ->  (
k  +  1 )  e.  ( K ... ( ( N  - 
1 )  +  1 ) ) )
5352adantl 275 . . . . . . . . 9  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( K ... (
( N  -  1 )  +  1 ) ) )
5453, 44eleqtrd 2243 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( K ... N
) )
5551, 54sseldd 3138 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( M ... N
) )
56 elfzuz 9947 . . . . . . 7  |-  ( ( k  +  1 )  e.  ( M ... N )  ->  (
k  +  1 )  e.  ( ZZ>= `  M
) )
5755, 56syl 14 . . . . . 6  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( ZZ>= `  M )
)
5847, 49, 57rspcdva 2830 . . . . 5  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( F `  ( k  +  1 ) )  e.  RR )
5946, 58addge01d 8422 . . . 4  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( 0  <_  ( F `  ( k  +  1 ) )  <->  (  seq M (  +  ,  F ) `  k
)  <_  ( (  seq M (  +  ,  F ) `  k
)  +  ( F `
 ( k  +  1 ) ) ) ) )
6041, 59mpbid 146 . . 3  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  (  seq M (  +  ,  F ) `  k
)  <_  ( (  seq M (  +  ,  F ) `  k
)  +  ( F `
 ( k  +  1 ) ) ) )
6145, 12syldan 280 . . . 4  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  k  e.  ( ZZ>= `  M )
)
627adantlr 469 . . . 4  |-  ( ( ( ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  RR )
63 readdcl 7870 . . . . 5  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( x  +  y )  e.  RR )
6463adantl 275 . . . 4  |-  ( ( ( ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  /\  (
x  e.  RR  /\  y  e.  RR )
)  ->  ( x  +  y )  e.  RR )
6561, 62, 64seq3p1 10387 . . 3  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  (  seq M (  +  ,  F ) `  (
k  +  1 ) )  =  ( (  seq M (  +  ,  F ) `  k )  +  ( F `  ( k  +  1 ) ) ) )
6660, 65breqtrrd 4004 . 2  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  (  seq M (  +  ,  F ) `  k
)  <_  (  seq M (  +  ,  F ) `  (
k  +  1 ) ) )
671, 13, 66monoord 10401 1  |-  ( ph  ->  (  seq M (  +  ,  F ) `
 K )  <_ 
(  seq M (  +  ,  F ) `  N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1342    e. wcel 2135   A.wral 2442    C_ wss 3111   class class class wbr 3976   ` cfv 5182  (class class class)co 5836   CCcc 7742   RRcr 7743   0cc0 7744   1c1 7745    + caddc 7747    <_ cle 7925    - cmin 8060   ZZcz 9182   ZZ>=cuz 9457   ...cfz 9935    seqcseq 10370
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-coll 4091  ax-sep 4094  ax-nul 4102  ax-pow 4147  ax-pr 4181  ax-un 4405  ax-setind 4508  ax-iinf 4559  ax-cnex 7835  ax-resscn 7836  ax-1cn 7837  ax-1re 7838  ax-icn 7839  ax-addcl 7840  ax-addrcl 7841  ax-mulcl 7842  ax-addcom 7844  ax-addass 7846  ax-distr 7848  ax-i2m1 7849  ax-0lt1 7850  ax-0id 7852  ax-rnegex 7853  ax-cnre 7855  ax-pre-ltirr 7856  ax-pre-ltwlin 7857  ax-pre-lttrn 7858  ax-pre-ltadd 7860
This theorem depends on definitions:  df-bi 116  df-3or 968  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-nel 2430  df-ral 2447  df-rex 2448  df-reu 2449  df-rab 2451  df-v 2723  df-sbc 2947  df-csb 3041  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-nul 3405  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-int 3819  df-iun 3862  df-br 3977  df-opab 4038  df-mpt 4039  df-tr 4075  df-id 4265  df-iord 4338  df-on 4340  df-ilim 4341  df-suc 4343  df-iom 4562  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-f 5186  df-f1 5187  df-fo 5188  df-f1o 5189  df-fv 5190  df-riota 5792  df-ov 5839  df-oprab 5840  df-mpo 5841  df-1st 6100  df-2nd 6101  df-recs 6264  df-frec 6350  df-pnf 7926  df-mnf 7927  df-xr 7928  df-ltxr 7929  df-le 7930  df-sub 8062  df-neg 8063  df-inn 8849  df-n0 9106  df-z 9183  df-uz 9458  df-fz 9936  df-seqfrec 10371
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator