Theorem ser3mono 10924

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 2238	. . . 4 |- ( ZZ>= ` M ) = ( ZZ>= ` M )
3		sermono.1	. . . . . 6 |- ( ph -> K e. ( ZZ>= ` M ) )
4		eluzel2 9926	. . . . . 6 |- ( K e. ( ZZ>= ` M ) -> M e. ZZ )
5	3, 4	syl 14	. . . . 5 |- ( ph -> M e. ZZ )
6	5	adantr 276	. . . 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 481	. . . 4 |- ( ( ( ph /\ k e. ( K ... N ) ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. RR )
9	2, 6, 8	serfre 10921	. . 3 |- ( ( ph /\ k e. ( K ... N ) ) -> seq M ( + , F ) : ( ZZ>= ` M ) --> RR )
10		elfzuz 10424	. . . 4 |- ( k e. ( K ... N ) -> k e. ( ZZ>= ` K ) )
11		uztrn 9939	. . . 4 |- ( ( k e. ( ZZ>= ` K ) /\ K e. ( ZZ>= ` M ) ) -> k e. ( ZZ>= ` M ) )
12	10, 3, 11	syl2anr 290	. . 3 |- ( ( ph /\ k e. ( K ... N ) ) -> k e. ( ZZ>= ` M ) )
13	9, 12	ffvelcdmd 5844	. 2 |- ( ( ph /\ k e. ( K ... N ) ) -> ( seq M ( + , F ) ` k ) e. RR )
14		fveq2 5695	. . . . . 6 |- ( x = ( k + 1 ) -> ( F ` x ) = ( F ` ( k + 1 ) ) )
15	14	breq2d 4142	. . . . 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 2623	. . . . . 6 |- ( ph -> A. x e. ( ( K + 1 ) ... N ) 0 <_ ( F ` x ) )
18	17	adantr 276	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> A. x e. ( ( K + 1 ) ... N ) 0 <_ ( F ` x ) )
19		simpr 110	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( K ... ( N - 1 ) ) )
20	3	adantr 276	. . . . . . . . 9 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> K e. ( ZZ>= ` M ) )
21		eluzelz 9931	. . . . . . . . 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 276	. . . . . . . . . 10 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> N e. ( ZZ>= ` K ) )
24		eluzelz 9931	. . . . . . . . . 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 9682	. . . . . . . . 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 10428	. . . . . . . . 9 |- ( k e. ( K ... ( N - 1 ) ) -> k e. ZZ )
29	28	adantl 277	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ZZ )
30		1zzd 9671	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> 1 e. ZZ )
31		fzaddel 10465	. . . . . . . 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 1279	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k e. ( K ... ( N - 1 ) ) <-> ( k + 1 ) e. ( ( K + 1 ) ... ( ( N - 1 ) + 1 ) ) ) )
33	19, 32	mpbid 147	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( ( K + 1 ) ... ( ( N - 1 ) + 1 ) ) )
34		zcn 9649	. . . . . . . . 9 |- ( N e. ZZ -> N e. CC )
35		ax-1cn 8272	. . . . . . . . 9 |- 1 e. CC
36		npcan 8535	. . . . . . . . 9 |- ( ( N e. CC /\ 1 e. CC ) -> ( ( N - 1 ) + 1 ) = N )
37	34, 35, 36	sylancl 417	. . . . . . . 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 6101	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( ( K + 1 ) ... ( ( N - 1 ) + 1 ) ) = ( ( K + 1 ) ... N ) )
40	33, 39	eleqtrd 2317	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( ( K + 1 ) ... N ) )
41	15, 18, 40	rspcdva 2934	. . . 4 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> 0 <_ ( F ` ( k + 1 ) ) )
42		fzelp1 10481	. . . . . . . 8 |- ( k e. ( K ... ( N - 1 ) ) -> k e. ( K ... ( ( N - 1 ) + 1 ) ) )
43	42	adantl 277	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( K ... ( ( N - 1 ) + 1 ) ) )
44	38	oveq2d 6101	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( K ... ( ( N - 1 ) + 1 ) ) = ( K ... N ) )
45	43, 44	eleqtrd 2317	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( K ... N ) )
46	45, 13	syldan 282	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` k ) e. RR )
47	14	eleq1d 2307	. . . . . 6 |- ( x = ( k + 1 ) -> ( ( F ` x ) e. RR <-> ( F ` ( k + 1 ) ) e. RR ) )
48	7	ralrimiva 2623	. . . . . . 7 |- ( ph -> A. x e. ( ZZ>= ` M ) ( F ` x ) e. RR )
49	48	adantr 276	. . . . . 6 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> A. x e. ( ZZ>= ` M ) ( F ` x ) e. RR )
50		fzss1 10469	. . . . . . . . 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 10482	. . . . . . . . . 10 |- ( k e. ( K ... ( N - 1 ) ) -> ( k + 1 ) e. ( K ... ( ( N - 1 ) + 1 ) ) )
53	52	adantl 277	. . . . . . . . 9 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( K ... ( ( N - 1 ) + 1 ) ) )
54	53, 44	eleqtrd 2317	. . . . . . . 8 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( K ... N ) )
55	51, 54	sseldd 3249	. . . . . . 7 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( k + 1 ) e. ( M ... N ) )
56		elfzuz 10424	. . . . . . 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 2934	. . . . 5 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( F ` ( k + 1 ) ) e. RR )
59	46, 58	addge01d 8861	. . . 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 147	. . 3 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` k ) <_ ( ( seq M ( + , F ) ` k ) + ( F ` ( k + 1 ) ) ) )
61	45, 12	syldan 282	. . . 4 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> k e. ( ZZ>= ` M ) )
62	7	adantlr 481	. . . 4 |- ( ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. RR )
63		readdcl 8305	. . . . 5 |- ( ( x e. RR /\ y e. RR ) -> ( x + y ) e. RR )
64	63	adantl 277	. . . 4 |- ( ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) /\ ( x e. RR /\ y e. RR ) ) -> ( x + y ) e. RR )
65	61, 62, 64	seq3p1 10902	. . 3 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` ( k + 1 ) ) = ( ( seq M ( + , F ) ` k ) + ( F ` ( k + 1 ) ) ) )
66	60, 65	breqtrrd 4158	. 2 |- ( ( ph /\ k e. ( K ... ( N - 1 ) ) ) -> ( seq M ( + , F ) ` k ) <_ ( seq M ( + , F ) ` ( k + 1 ) ) )
67	1, 13, 66	monoord 10922	1 |- ( ph -> ( seq M ( + , F ) ` K ) <_ ( seq M ( + , F ) ` N ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   C_ wss 3220   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   1c1 8180   + caddc 8182   <_ cle 8361   - cmin 8497   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411   seqcseq 10884

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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  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-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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-seqfrec 10885

This theorem is used by: (None)