| 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 2234 | . 2 ⊢ (ℤ≥‘𝑁) = (ℤ≥‘𝑁) | |
| 2 | climub.2 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | clim2iser.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrdi 2327 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzelz 9881 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fveq2 5675 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 8 | 7 | eleq1d 2303 | . . . . 5 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑁) ∈ ℝ)) |
| 9 | 8 | imbi2d 230 | . . . 4 ⊢ (𝑘 = 𝑁 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑁) ∈ ℝ))) |
| 10 | climub.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) | |
| 11 | 10 | expcom 116 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → (𝐹‘𝑘) ∈ ℝ)) |
| 12 | 9, 11 | vtoclga 2883 | . . 3 ⊢ (𝑁 ∈ 𝑍 → (𝜑 → (𝐹‘𝑁) ∈ ℝ)) |
| 13 | 2, 12 | mpcom 36 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ) |
| 14 | climub.3 | . 2 ⊢ (𝜑 → 𝐹 ⇝ 𝐴) | |
| 15 | 3 | uztrn2 9890 | . . . 4 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 16 | 2, 15 | sylan 283 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 17 | fveq2 5675 | . . . . . . 7 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
| 18 | 17 | eleq1d 2303 | . . . . . 6 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑗) ∈ ℝ)) |
| 19 | 18 | imbi2d 230 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑗) ∈ ℝ))) |
| 20 | 19, 11 | vtoclga 2883 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (𝜑 → (𝐹‘𝑗) ∈ ℝ)) |
| 21 | 20 | impcom 125 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ) |
| 22 | 16, 21 | syldan 282 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑗) ∈ ℝ) |
| 23 | simpr 110 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ (ℤ≥‘𝑁)) | |
| 24 | elfzuz 10374 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...𝑗) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
| 25 | 3 | uztrn2 9890 | . . . . . . 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 10374 | . . . . 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 10871 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑁) ≤ (𝐹‘𝑗)) |
| 36 | 1, 6, 13, 14, 22, 35 | climlec2 12051 | 1 ⊢ (𝜑 → (𝐹‘𝑁) ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 class class class wbr 4114 ‘cfv 5357 (class class class)co 6058 ℝcr 8142 1c1 8144 + caddc 8146 ≤ cle 8325 − cmin 8460 ℤcz 9594 ℤ≥cuz 9871 ...cfz 10361 ⇝ cli 11988 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 ax-arch 8262 ax-caucvg 8263 |
| 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 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-2 9313 df-3 9314 df-4 9315 df-n0 9514 df-z 9595 df-uz 9872 df-rp 10005 df-fz 10362 df-seqfrec 10834 df-exp 10925 df-cj 11552 df-re 11553 df-im 11554 df-rsqrt 11708 df-abs 11709 df-clim 11989 |
| This theorem is referenced by: climserle 12055 |
| Copyright terms: Public domain | W3C validator |