| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > climub | GIF version | ||
| Description: The limit of a monotonic sequence is an upper bound. (Contributed by NM, 18-Mar-2005.) (Revised by Mario Carneiro, 10-Feb-2014.) |
| Ref | Expression |
|---|---|
| clim2iser.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| climub.2 | ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
| climub.3 | ⊢ (𝜑 → 𝐹 ⇝ 𝐴) |
| climub.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) |
| climub.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ≤ (𝐹‘(𝑘 + 1))) |
| Ref | Expression |
|---|---|
| climub | ⊢ (𝜑 → (𝐹‘𝑁) ≤ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 | . 2 ⊢ (ℤ≥‘𝑁) = (ℤ≥‘𝑁) | |
| 2 | climub.2 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | clim2iser.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrdi 2324 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzelz 9809 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fveq2 5648 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 8 | 7 | eleq1d 2300 | . . . . 5 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑁) ∈ ℝ)) |
| 9 | 8 | imbi2d 230 | . . . 4 ⊢ (𝑘 = 𝑁 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑁) ∈ ℝ))) |
| 10 | climub.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) | |
| 11 | 10 | expcom 116 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → (𝐹‘𝑘) ∈ ℝ)) |
| 12 | 9, 11 | vtoclga 2871 | . . 3 ⊢ (𝑁 ∈ 𝑍 → (𝜑 → (𝐹‘𝑁) ∈ ℝ)) |
| 13 | 2, 12 | mpcom 36 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ) |
| 14 | climub.3 | . 2 ⊢ (𝜑 → 𝐹 ⇝ 𝐴) | |
| 15 | 3 | uztrn2 9818 | . . . 4 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 16 | 2, 15 | sylan 283 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 17 | fveq2 5648 | . . . . . . 7 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
| 18 | 17 | eleq1d 2300 | . . . . . 6 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑗) ∈ ℝ)) |
| 19 | 18 | imbi2d 230 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑗) ∈ ℝ))) |
| 20 | 19, 11 | vtoclga 2871 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (𝜑 → (𝐹‘𝑗) ∈ ℝ)) |
| 21 | 20 | impcom 125 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ) |
| 22 | 16, 21 | syldan 282 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑗) ∈ ℝ) |
| 23 | simpr 110 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ (ℤ≥‘𝑁)) | |
| 24 | elfzuz 10301 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...𝑗) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
| 25 | 3 | uztrn2 9818 | . . . . . . 7 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → 𝑘 ∈ 𝑍) |
| 26 | 2, 25 | sylan 283 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → 𝑘 ∈ 𝑍) |
| 27 | 26, 10 | syldan 282 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑘) ∈ ℝ) |
| 28 | 24, 27 | sylan2 286 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁...𝑗)) → (𝐹‘𝑘) ∈ ℝ) |
| 29 | 28 | adantlr 477 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (𝑁...𝑗)) → (𝐹‘𝑘) ∈ ℝ) |
| 30 | elfzuz 10301 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...(𝑗 − 1)) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
| 31 | climub.5 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ≤ (𝐹‘(𝑘 + 1))) | |
| 32 | 26, 31 | syldan 282 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑘) ≤ (𝐹‘(𝑘 + 1))) |
| 33 | 30, 32 | sylan2 286 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑁...(𝑗 − 1))) → (𝐹‘𝑘) ≤ (𝐹‘(𝑘 + 1))) |
| 34 | 33 | adantlr 477 | . . 3 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (𝑁...(𝑗 − 1))) → (𝐹‘𝑘) ≤ (𝐹‘(𝑘 + 1))) |
| 35 | 23, 29, 34 | monoord 10793 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑁) ≤ (𝐹‘𝑗)) |
| 36 | 1, 6, 13, 14, 22, 35 | climlec2 11964 | 1 ⊢ (𝜑 → (𝐹‘𝑁) ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 class class class wbr 4093 ‘cfv 5333 (class class class)co 6028 ℝcr 8074 1c1 8076 + caddc 8078 ≤ cle 8257 − cmin 8392 ℤcz 9523 ℤ≥cuz 9799 ...cfz 10288 ⇝ cli 11901 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-n0 9445 df-z 9524 df-uz 9800 df-rp 9933 df-fz 10289 df-seqfrec 10756 df-exp 10847 df-cj 11465 df-re 11466 df-im 11467 df-rsqrt 11621 df-abs 11622 df-clim 11902 |
| This theorem is referenced by: climserle 11968 |
| Copyright terms: Public domain | W3C validator |