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

Theorem ser3mono 10254
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 2139 . . . 4  |-  ( ZZ>= `  M )  =  (
ZZ>= `  M )
3 sermono.1 . . . . . 6  |-  ( ph  ->  K  e.  ( ZZ>= `  M ) )
4 eluzel2 9334 . . . . . 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 468 . . . 4  |-  ( ( ( ph  /\  k  e.  ( K ... N
) )  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  RR )
92, 6, 8serfre 10251 . . 3  |-  ( (
ph  /\  k  e.  ( K ... N ) )  ->  seq M (  +  ,  F ) : ( ZZ>= `  M
) --> RR )
10 elfzuz 9805 . . . 4  |-  ( k  e.  ( K ... N )  ->  k  e.  ( ZZ>= `  K )
)
11 uztrn 9345 . . . 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 5556 . 2  |-  ( (
ph  /\  k  e.  ( K ... N ) )  ->  (  seq M (  +  ,  F ) `  k
)  e.  RR )
14 fveq2 5421 . . . . . 6  |-  ( x  =  ( k  +  1 )  ->  ( F `  x )  =  ( F `  ( k  +  1 ) ) )
1514breq2d 3941 . . . . 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 2505 . . . . . 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 9338 . . . . . . . . 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 9338 . . . . . . . . . 10  |-  ( N  e.  ( ZZ>= `  K
)  ->  N  e.  ZZ )
2523, 24syl 14 . . . . . . . . 9  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  N  e.  ZZ )
26 peano2zm 9095 . . . . . . . . 9  |-  ( N  e.  ZZ  ->  ( N  -  1 )  e.  ZZ )
2725, 26syl 14 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( N  -  1 )  e.  ZZ )
28 elfzelz 9809 . . . . . . . . 9  |-  ( k  e.  ( K ... ( N  -  1
) )  ->  k  e.  ZZ )
2928adantl 275 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  k  e.  ZZ )
30 1zzd 9084 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  1  e.  ZZ )
31 fzaddel 9842 . . . . . . . 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 1217 . . . . . . 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 9062 . . . . . . . . 9  |-  ( N  e.  ZZ  ->  N  e.  CC )
35 ax-1cn 7716 . . . . . . . . 9  |-  1  e.  CC
36 npcan 7974 . . . . . . . . 9  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
3734, 35, 36sylancl 409 . . . . . . . 8  |-  ( N  e.  ZZ  ->  (
( N  -  1 )  +  1 )  =  N )
3825, 37syl 14 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( ( N  -  1 )  +  1 )  =  N )
3938oveq2d 5790 . . . . . 6  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( ( K  +  1 ) ... ( ( N  -  1 )  +  1 ) )  =  ( ( K  + 
1 ) ... N
) )
4033, 39eleqtrd 2218 . . . . 5  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( ( K  + 
1 ) ... N
) )
4115, 18, 40rspcdva 2794 . . . 4  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  0  <_  ( F `  ( k  +  1 ) ) )
42 fzelp1 9857 . . . . . . . 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 5790 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( K ... ( ( N  - 
1 )  +  1 ) )  =  ( K ... N ) )
4543, 44eleqtrd 2218 . . . . . 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 2208 . . . . . 6  |-  ( x  =  ( k  +  1 )  ->  (
( F `  x
)  e.  RR  <->  ( F `  ( k  +  1 ) )  e.  RR ) )
487ralrimiva 2505 . . . . . . 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 9846 . . . . . . . . 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 9858 . . . . . . . . . 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 2218 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( K ... N
) )
5551, 54sseldd 3098 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( k  +  1 )  e.  ( M ... N
) )
56 elfzuz 9805 . . . . . . 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 2794 . . . . 5  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  ( F `  ( k  +  1 ) )  e.  RR )
5946, 58addge01d 8298 . . . 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 468 . . . 4  |-  ( ( ( ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  RR )
63 readdcl 7749 . . . . 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 10238 . . 3  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  (  seq M (  +  ,  F ) `  (
k  +  1 ) )  =  ( (  seq M (  +  ,  F ) `  k )  +  ( F `  ( k  +  1 ) ) ) )
6660, 65breqtrrd 3956 . 2  |-  ( (
ph  /\  k  e.  ( K ... ( N  -  1 ) ) )  ->  (  seq M (  +  ,  F ) `  k
)  <_  (  seq M (  +  ,  F ) `  (
k  +  1 ) ) )
671, 13, 66monoord 10252 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 1331    e. wcel 1480   A.wral 2416    C_ wss 3071   class class class wbr 3929   ` cfv 5123  (class class class)co 5774   CCcc 7621   RRcr 7622   0cc0 7623   1c1 7624    + caddc 7626    <_ cle 7804    - cmin 7936   ZZcz 9057   ZZ>=cuz 9329   ...cfz 9793    seqcseq 10221
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7714  ax-resscn 7715  ax-1cn 7716  ax-1re 7717  ax-icn 7718  ax-addcl 7719  ax-addrcl 7720  ax-mulcl 7721  ax-addcom 7723  ax-addass 7725  ax-distr 7727  ax-i2m1 7728  ax-0lt1 7729  ax-0id 7731  ax-rnegex 7732  ax-cnre 7734  ax-pre-ltirr 7735  ax-pre-ltwlin 7736  ax-pre-lttrn 7737  ax-pre-ltadd 7739
This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-pnf 7805  df-mnf 7806  df-xr 7807  df-ltxr 7808  df-le 7809  df-sub 7938  df-neg 7939  df-inn 8724  df-n0 8981  df-z 9058  df-uz 9330  df-fz 9794  df-seqfrec 10222
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator