| 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 2196 | . 2 ⊢ (ℤ≥‘𝑁) = (ℤ≥‘𝑁) | |
| 2 | climub.2 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | clim2iser.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrdi 2289 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzelz 9627 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fveq2 5561 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 8 | 7 | eleq1d 2265 | . . . . 5 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑁) ∈ ℝ)) |
| 9 | 8 | imbi2d 230 | . . . 4 ⊢ (𝑘 = 𝑁 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑁) ∈ ℝ))) |
| 10 | climub.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) | |
| 11 | 10 | expcom 116 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → (𝐹‘𝑘) ∈ ℝ)) |
| 12 | 9, 11 | vtoclga 2830 | . . 3 ⊢ (𝑁 ∈ 𝑍 → (𝜑 → (𝐹‘𝑁) ∈ ℝ)) |
| 13 | 2, 12 | mpcom 36 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ) |
| 14 | climub.3 | . 2 ⊢ (𝜑 → 𝐹 ⇝ 𝐴) | |
| 15 | 3 | uztrn2 9636 | . . . 4 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 16 | 2, 15 | sylan 283 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 17 | fveq2 5561 | . . . . . . 7 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
| 18 | 17 | eleq1d 2265 | . . . . . 6 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑗) ∈ ℝ)) |
| 19 | 18 | imbi2d 230 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑗) ∈ ℝ))) |
| 20 | 19, 11 | vtoclga 2830 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (𝜑 → (𝐹‘𝑗) ∈ ℝ)) |
| 21 | 20 | impcom 125 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ) |
| 22 | 16, 21 | syldan 282 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑗) ∈ ℝ) |
| 23 | simpr 110 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ (ℤ≥‘𝑁)) | |
| 24 | elfzuz 10113 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...𝑗) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
| 25 | 3 | uztrn2 9636 | . . . . . . 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 10113 | . . . . 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 10594 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑁) ≤ (𝐹‘𝑗)) |
| 36 | 1, 6, 13, 14, 22, 35 | climlec2 11523 | 1 ⊢ (𝜑 → (𝐹‘𝑁) ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 class class class wbr 4034 ‘cfv 5259 (class class class)co 5925 ℝcr 7895 1c1 7897 + caddc 7899 ≤ cle 8079 − cmin 8214 ℤcz 9343 ℤ≥cuz 9618 ...cfz 10100 ⇝ cli 11460 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-mulrcl 7995 ax-addcom 7996 ax-mulcom 7997 ax-addass 7998 ax-mulass 7999 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-1rid 8003 ax-0id 8004 ax-rnegex 8005 ax-precex 8006 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 ax-pre-mulgt0 8013 ax-pre-mulext 8014 ax-arch 8015 ax-caucvg 8016 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-frec 6458 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-reap 8619 df-ap 8626 df-div 8717 df-inn 9008 df-2 9066 df-3 9067 df-4 9068 df-n0 9267 df-z 9344 df-uz 9619 df-rp 9746 df-fz 10101 df-seqfrec 10557 df-exp 10648 df-cj 11024 df-re 11025 df-im 11026 df-rsqrt 11180 df-abs 11181 df-clim 11461 |
| This theorem is referenced by: climserle 11527 |
| Copyright terms: Public domain | W3C validator |