Theorem climub 12110

Description: The limit of a monotonic sequence is an upper bound. (Contributed by NM, 18-Mar-2005.) (Revised by Mario Carneiro, 10-Feb-2014.)

Hypotheses

Ref	Expression
clim2iser.1	|- Z = ( ZZ>= ` M )
climub.2	|- ( ph -> N e. Z )
climub.3	|- ( ph -> F ~~> A )
climub.4	|- ( ( ph /\ k e. Z ) -> ( F ` k ) e. RR )
climub.5	|- ( ( ph /\ k e. Z ) -> ( F ` k ) <_ ( F ` ( k + 1 ) ) )

Assertion

Ref	Expression
climub	|- ( ph -> ( F ` N ) <_ A )

Distinct variable groups:   A, k   k, F   k, M   k, N   ph, k   k, Z

Proof of Theorem climub

Dummy variable j is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2238	. 2 |- ( ZZ>= ` N ) = ( ZZ>= ` N )
2		climub.2	. . . 4 |- ( ph -> N e. Z )
3		clim2iser.1	. . . 4 |- Z = ( ZZ>= ` M )
4	2, 3	eleqtrdi 2331	. . 3 |- ( ph -> N e. ( ZZ>= ` M ) )
5		eluzelz 9931	. . 3 |- ( N e. ( ZZ>= ` M ) -> N e. ZZ )
6	4, 5	syl 14	. 2 |- ( ph -> N e. ZZ )
7		fveq2 5695	. . . . . 6 |- ( k = N -> ( F ` k ) = ( F ` N ) )
8	7	eleq1d 2307	. . . . 5 |- ( k = N -> ( ( F ` k ) e. RR <-> ( F ` N ) e. RR ) )
9	8	imbi2d 230	. . . 4 |- ( k = N -> ( ( ph -> ( F ` k ) e. RR ) <-> ( ph -> ( F ` N ) e. RR ) ) )
10		climub.4	. . . . 5 |- ( ( ph /\ k e. Z ) -> ( F ` k ) e. RR )
11	10	expcom 116	. . . 4 |- ( k e. Z -> ( ph -> ( F ` k ) e. RR ) )
12	9, 11	vtoclga 2889	. . 3 |- ( N e. Z -> ( ph -> ( F ` N ) e. RR ) )
13	2, 12	mpcom 36	. 2 |- ( ph -> ( F ` N ) e. RR )
14		climub.3	. 2 |- ( ph -> F ~~> A )
15	3	uztrn2 9940	. . . 4 |- ( ( N e. Z /\ j e. ( ZZ>= ` N ) ) -> j e. Z )
16	2, 15	sylan 283	. . 3 |- ( ( ph /\ j e. ( ZZ>= ` N ) ) -> j e. Z )
17		fveq2 5695	. . . . . . 7 |- ( k = j -> ( F ` k ) = ( F ` j ) )
18	17	eleq1d 2307	. . . . . 6 |- ( k = j -> ( ( F ` k ) e. RR <-> ( F ` j ) e. RR ) )
19	18	imbi2d 230	. . . . 5 |- ( k = j -> ( ( ph -> ( F ` k ) e. RR ) <-> ( ph -> ( F ` j ) e. RR ) ) )
20	19, 11	vtoclga 2889	. . . 4 |- ( j e. Z -> ( ph -> ( F ` j ) e. RR ) )
21	20	impcom 125	. . 3 |- ( ( ph /\ j e. Z ) -> ( F ` j ) e. RR )
22	16, 21	syldan 282	. 2 |- ( ( ph /\ j e. ( ZZ>= ` N ) ) -> ( F ` j ) e. RR )
23		simpr 110	. . 3 |- ( ( ph /\ j e. ( ZZ>= ` N ) ) -> j e. ( ZZ>= ` N ) )
24		elfzuz 10424	. . . . 5 |- ( k e. ( N ... j ) -> k e. ( ZZ>= ` N ) )
25	3	uztrn2 9940	. . . . . . 7 |- ( ( N e. Z /\ k e. ( ZZ>= ` N ) ) -> k e. Z )
26	2, 25	sylan 283	. . . . . 6 |- ( ( ph /\ k e. ( ZZ>= ` N ) ) -> k e. Z )
27	26, 10	syldan 282	. . . . 5 |- ( ( ph /\ k e. ( ZZ>= ` N ) ) -> ( F ` k ) e. RR )
28	24, 27	sylan2 286	. . . 4 |- ( ( ph /\ k e. ( N ... j ) ) -> ( F ` k ) e. RR )
29	28	adantlr 481	. . 3 |- ( ( ( ph /\ j e. ( ZZ>= ` N ) ) /\ k e. ( N ... j ) ) -> ( F ` k ) e. RR )
30		elfzuz 10424	. . . . 5 |- ( k e. ( N ... ( j - 1 ) ) -> k e. ( ZZ>= ` N ) )
31		climub.5	. . . . . 6 |- ( ( ph /\ k e. Z ) -> ( F ` k ) <_ ( F ` ( k + 1 ) ) )
32	26, 31	syldan 282	. . . . 5 |- ( ( ph /\ k e. ( ZZ>= ` N ) ) -> ( F ` k ) <_ ( F ` ( k + 1 ) ) )
33	30, 32	sylan2 286	. . . 4 |- ( ( ph /\ k e. ( N ... ( j - 1 ) ) ) -> ( F ` k ) <_ ( F ` ( k + 1 ) ) )
34	33	adantlr 481	. . 3 |- ( ( ( ph /\ j e. ( ZZ>= ` N ) ) /\ k e. ( N ... ( j - 1 ) ) ) -> ( F ` k ) <_ ( F ` ( k + 1 ) ) )
35	23, 29, 34	monoord 10922	. 2 |- ( ( ph /\ j e. ( ZZ>= ` N ) ) -> ( F ` N ) <_ ( F ` j ) )
36	1, 6, 13, 14, 22, 35	climlec2 12107	1 |- ( ph -> ( F ` N ) <_ A )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   RRcr 8178   1c1 8180   + caddc 8182   <_ cle 8361   - cmin 8497   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411   ~~> cli 12044

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-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

This proof depends on definitions:  df-bi 117  df-dc 847  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-rmo 2536  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-if 3639  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-po 4441  df-iso 4442  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-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-rp 10055  df-fz 10412  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-clim 12045

This theorem is used by:  climserle  12111