Theorem ser3mono 10092

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.

Step	Hyp	Ref	Expression
1		sermono.2	. 2 |- ( ph -> N e. ( ZZ>= ` K ) )
2		eqid 2100	. . . 4 |- ( ZZ>= ` M ) = ( ZZ>= ` M )
3		sermono.1	. . . . . 6 |- ( ph -> K e. ( ZZ>= ` M ) )
4		eluzel2 9181	. . . . . 6 |- ( K e. ( ZZ>= ` M ) -> M e. ZZ )
5	3, 4	syl 14	. . . . 5 |- ( ph -> M e. ZZ )
6	5	adantr 272	. . . 4 |- ( ( ph /\ k e. ( K ... N ) ) -> M e. ZZ )
7		ser3mono.3	. . . . 5 |- ( ( ph /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. RR )
8	7	adantlr 464	. . . 4 |- ( ( ( ph /\ k e. ( K ... N ) ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. RR )
9	2, 6, 8	serfre 10089	. . 3 |- ( ( ph /\ k e. ( K ... N ) ) -> seq M ( + , F ) : ( ZZ>= ` M ) --> RR )
10		elfzuz 9643	. . . 4 |- ( k e. ( K ... N ) -> k e. ( ZZ>= ` K ) )
11		uztrn 9192	. . . 4 |- ( ( k e. ( ZZ>= ` K ) /\ K e. ( ZZ>= ` M ) ) -> k e. ( ZZ>= ` M ) )
12	10, 3, 11	syl2anr 286	. . 3 |- ( ( ph /\ k e. ( K ... N ) ) -> k e. ( ZZ>= ` M ) )
13	9, 12	ffvelrnd 5488	. 2 |- ( ( ph /\ k e. ( K ... N ) ) -> ( seq M ( + , F ) ` k ) e. RR )
14		fveq2 5353	. . . . . 6 |- ( x = ( k + 1 ) -> ( F ` x ) = ( F ` ( k + 1 ) ) )
15	14	breq2d 3887	. . . . 5 |- ( x = ( k + 1 ) -> ( 0 <_ ( F ` x ) <-> 0 <_ ( F ` ( k + 1 ) ) ) )
16		sermono.4	. . . . . . 7 |- ( ( ph /\ x e. ( ( K + 1 ) ... N ) ) -> 0 <_ ( F ` x ) )
17	16	ralrimiva 2464	. . . . . 6 |- ( ph -> A. x e. ( ( K + 1 ) ... N ) 0 <_ ( F ` x ) )
18	17	adantr 272	. . . . 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 ) ) )
20	3	adantr 272	. . . . . . . . 9 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> K e. ( ZZ>= ` M ) )
21		eluzelz 9185	. . . . . . . . 9 |- ( K e. ( ZZ>= ` M ) -> K e. ZZ )
22	20, 21	syl 14	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> K e. ZZ )
23	1	adantr 272	. . . . . . . . . 10 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> N e. ( ZZ>= ` K ) )
24		eluzelz 9185	. . . . . . . . . 10 |- ( N e. ( ZZ>= ` K ) -> N e. ZZ )
25	23, 24	syl 14	. . . . . . . . 9 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> N e. ZZ )
26		peano2zm 8944	. . . . . . . . 9 |- ( N e. ZZ -> ( N - 1 ) e. ZZ )
27	25, 26	syl 14	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( N - 1 ) e. ZZ )
28		elfzelz 9647	. . . . . . . . 9 |- ( k e. ( K ... ( N - 1 ) ) -> k e. ZZ )
29	28	adantl 273	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ZZ )
30		1zzd 8933	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> 1 e. ZZ )
31		fzaddel 9680	. . . . . . . 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 ) ) ) )
32	22, 27, 29, 30, 31	syl22anc 1185	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k e. ( K ... ( N - 1 ) ) <-> ( k + 1 ) e. ( ( K + 1 ) ... ( ( N - 1 ) + 1 ) ) ) )
33	19, 32	mpbid 146	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( ( K + 1 ) ... ( ( N - 1 ) + 1 ) ) )
34		zcn 8911	. . . . . . . . 9 |- ( N e. ZZ -> N e. CC )
35		ax-1cn 7588	. . . . . . . . 9 |- 1 e. CC
36		npcan 7842	. . . . . . . . 9 |- ( ( N e. CC /\ 1 e. CC ) -> ( ( N - 1 ) + 1 ) = N )
37	34, 35, 36	sylancl 407	. . . . . . . 8 |- ( N e. ZZ -> ( ( N - 1 ) + 1 ) = N )
38	25, 37	syl 14	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( ( N - 1 ) + 1 ) = N )
39	38	oveq2d 5722	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( ( K + 1 ) ... ( ( N - 1 ) + 1 ) ) = ( ( K + 1 ) ... N ) )
40	33, 39	eleqtrd 2178	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( ( K + 1 ) ... N ) )
41	15, 18, 40	rspcdva 2749	. . . 4 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> 0 <_ ( F ` ( k + 1 ) ) )
42		fzelp1 9695	. . . . . . . 8 |- ( k e. ( K ... ( N - 1 ) ) -> k e. ( K ... ( ( N - 1 ) + 1 ) ) )
43	42	adantl 273	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( K ... ( ( N - 1 ) + 1 ) ) )
44	38	oveq2d 5722	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( K ... ( ( N - 1 ) + 1 ) ) = ( K ... N ) )
45	43, 44	eleqtrd 2178	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( K ... N ) )
46	45, 13	syldan 278	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` k ) e. RR )
47	14	eleq1d 2168	. . . . . 6 |- ( x = ( k + 1 ) -> ( ( F ` x ) e. RR <-> ( F ` ( k + 1 ) ) e. RR ) )
48	7	ralrimiva 2464	. . . . . . 7 |- ( ph -> A. x e. ( ZZ>= ` M ) ( F ` x ) e. RR )
49	48	adantr 272	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> A. x e. ( ZZ>= ` M ) ( F ` x ) e. RR )
50		fzss1 9684	. . . . . . . . 9 |- ( K e. ( ZZ>= ` M ) -> ( K ... N ) C_ ( M ... N ) )
51	20, 50	syl 14	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( K ... N ) C_ ( M ... N ) )
52		fzp1elp1 9696	. . . . . . . . . 10 |- ( k e. ( K ... ( N - 1 ) ) -> ( k + 1 ) e. ( K ... ( ( N - 1 ) + 1 ) ) )
53	52	adantl 273	. . . . . . . . 9 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( K ... ( ( N - 1 ) + 1 ) ) )
54	53, 44	eleqtrd 2178	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( K ... N ) )
55	51, 54	sseldd 3048	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( M ... N ) )
56		elfzuz 9643	. . . . . . 7 |- ( ( k + 1 ) e. ( M ... N ) -> ( k + 1 ) e. ( ZZ>= ` M ) )
57	55, 56	syl 14	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( ZZ>= ` M ) )
58	47, 49, 57	rspcdva 2749	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( F ` ( k + 1 ) ) e. RR )
59	46, 58	addge01d 8161	. . . 4 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( 0 <_ ( F ` ( k + 1 ) ) <-> ( seq M ( + , F ) ` k ) <_ ( ( seq M ( + , F ) ` k ) + ( F ` ( k + 1 ) ) ) ) )
60	41, 59	mpbid 146	. . 3 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` k ) <_ ( ( seq M ( + , F ) ` k ) + ( F ` ( k + 1 ) ) ) )
61	45, 12	syldan 278	. . . 4 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( ZZ>= ` M ) )
62	7	adantlr 464	. . . 4 |- ( ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. RR )
63		readdcl 7618	. . . . 5 |- ( ( x e. RR /\ y e. RR ) -> ( x + y ) e. RR )
64	63	adantl 273	. . . 4 |- ( ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) /\ ( x e. RR /\ y e. RR ) ) -> ( x + y ) e. RR )
65	61, 62, 64	seq3p1 10076	. . 3 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` ( k + 1 ) ) = ( ( seq M ( + , F ) ` k ) + ( F ` ( k + 1 ) ) ) )
66	60, 65	breqtrrd 3901	. 2 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` k ) <_ ( seq M ( + , F ) ` ( k + 1 ) ) )
67	1, 13, 66	monoord 10090	1 |- ( ph -> ( seq M ( + , F ) ` K ) <_ ( seq M ( + , F ) ` N ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1299   e. wcel 1448   A.wral 2375   C_ wss 3021   class class class wbr 3875   ` cfv 5059  (class class class)co 5706   CCcc 7498   RRcr 7499   0cc0 7500   1c1 7501   + caddc 7503   <_ cle 7673   - cmin 7804   ZZcz 8906   ZZ>=cuz 9176   ...cfz 9631   seqcseq 10059

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 584  ax-in2 585  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-coll 3983  ax-sep 3986  ax-nul 3994  ax-pow 4038  ax-pr 4069  ax-un 4293  ax-setind 4390  ax-iinf 4440  ax-cnex 7586  ax-resscn 7587  ax-1cn 7588  ax-1re 7589  ax-icn 7590  ax-addcl 7591  ax-addrcl 7592  ax-mulcl 7593  ax-addcom 7595  ax-addass 7597  ax-distr 7599  ax-i2m1 7600  ax-0lt1 7601  ax-0id 7603  ax-rnegex 7604  ax-cnre 7606  ax-pre-ltirr 7607  ax-pre-ltwlin 7608  ax-pre-lttrn 7609  ax-pre-ltadd 7611

This theorem depends on definitions:  df-bi 116  df-3or 931  df-3an 932  df-tru 1302  df-fal 1305  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ne 2268  df-nel 2363  df-ral 2380  df-rex 2381  df-reu 2382  df-rab 2384  df-v 2643  df-sbc 2863  df-csb 2956  df-dif 3023  df-un 3025  df-in 3027  df-ss 3034  df-nul 3311  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-int 3719  df-iun 3762  df-br 3876  df-opab 3930  df-mpt 3931  df-tr 3967  df-id 4153  df-iord 4226  df-on 4228  df-ilim 4229  df-suc 4231  df-iom 4443  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-f1 5064  df-fo 5065  df-f1o 5066  df-fv 5067  df-riota 5662  df-ov 5709  df-oprab 5710  df-mpo 5711  df-1st 5969  df-2nd 5970  df-recs 6132  df-frec 6218  df-pnf 7674  df-mnf 7675  df-xr 7676  df-ltxr 7677  df-le 7678  df-sub 7806  df-neg 7807  df-inn 8579  df-n0 8830  df-z 8907  df-uz 9177  df-fz 9632  df-seqfrec 10060

This theorem is referenced by: (None)