| 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 2204 | . 2 ⊢ (ℤ≥‘𝑁) = (ℤ≥‘𝑁) | |
| 2 | climub.2 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | clim2iser.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrdi 2297 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzelz 9639 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fveq2 5570 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 8 | 7 | eleq1d 2273 | . . . . 5 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑁) ∈ ℝ)) |
| 9 | 8 | imbi2d 230 | . . . 4 ⊢ (𝑘 = 𝑁 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑁) ∈ ℝ))) |
| 10 | climub.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) | |
| 11 | 10 | expcom 116 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → (𝐹‘𝑘) ∈ ℝ)) |
| 12 | 9, 11 | vtoclga 2838 | . . 3 ⊢ (𝑁 ∈ 𝑍 → (𝜑 → (𝐹‘𝑁) ∈ ℝ)) |
| 13 | 2, 12 | mpcom 36 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ) |
| 14 | climub.3 | . 2 ⊢ (𝜑 → 𝐹 ⇝ 𝐴) | |
| 15 | 3 | uztrn2 9648 | . . . 4 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 16 | 2, 15 | sylan 283 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 17 | fveq2 5570 | . . . . . . 7 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
| 18 | 17 | eleq1d 2273 | . . . . . 6 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑗) ∈ ℝ)) |
| 19 | 18 | imbi2d 230 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑗) ∈ ℝ))) |
| 20 | 19, 11 | vtoclga 2838 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (𝜑 → (𝐹‘𝑗) ∈ ℝ)) |
| 21 | 20 | impcom 125 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ) |
| 22 | 16, 21 | syldan 282 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑗) ∈ ℝ) |
| 23 | simpr 110 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ (ℤ≥‘𝑁)) | |
| 24 | elfzuz 10125 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...𝑗) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
| 25 | 3 | uztrn2 9648 | . . . . . . 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 10125 | . . . . 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 10611 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑁) ≤ (𝐹‘𝑗)) |
| 36 | 1, 6, 13, 14, 22, 35 | climlec2 11571 | 1 ⊢ (𝜑 → (𝐹‘𝑁) ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1372 ∈ wcel 2175 class class class wbr 4043 ‘cfv 5268 (class class class)co 5934 ℝcr 7906 1c1 7908 + caddc 7910 ≤ cle 8090 − cmin 8225 ℤcz 9354 ℤ≥cuz 9630 ...cfz 10112 ⇝ cli 11508 |
| 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 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-nul 4169 ax-pow 4217 ax-pr 4252 ax-un 4478 ax-setind 4583 ax-iinf 4634 ax-cnex 7998 ax-resscn 7999 ax-1cn 8000 ax-1re 8001 ax-icn 8002 ax-addcl 8003 ax-addrcl 8004 ax-mulcl 8005 ax-mulrcl 8006 ax-addcom 8007 ax-mulcom 8008 ax-addass 8009 ax-mulass 8010 ax-distr 8011 ax-i2m1 8012 ax-0lt1 8013 ax-1rid 8014 ax-0id 8015 ax-rnegex 8016 ax-precex 8017 ax-cnre 8018 ax-pre-ltirr 8019 ax-pre-ltwlin 8020 ax-pre-lttrn 8021 ax-pre-apti 8022 ax-pre-ltadd 8023 ax-pre-mulgt0 8024 ax-pre-mulext 8025 ax-arch 8026 ax-caucvg 8027 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rmo 2491 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-if 3571 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-tr 4142 df-id 4338 df-po 4341 df-iso 4342 df-iord 4411 df-on 4413 df-ilim 4414 df-suc 4416 df-iom 4637 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-rn 4684 df-res 4685 df-ima 4686 df-iota 5229 df-fun 5270 df-fn 5271 df-f 5272 df-f1 5273 df-fo 5274 df-f1o 5275 df-fv 5276 df-riota 5889 df-ov 5937 df-oprab 5938 df-mpo 5939 df-1st 6216 df-2nd 6217 df-recs 6381 df-frec 6467 df-pnf 8091 df-mnf 8092 df-xr 8093 df-ltxr 8094 df-le 8095 df-sub 8227 df-neg 8228 df-reap 8630 df-ap 8637 df-div 8728 df-inn 9019 df-2 9077 df-3 9078 df-4 9079 df-n0 9278 df-z 9355 df-uz 9631 df-rp 9758 df-fz 10113 df-seqfrec 10574 df-exp 10665 df-cj 11072 df-re 11073 df-im 11074 df-rsqrt 11228 df-abs 11229 df-clim 11509 |
| This theorem is referenced by: climserle 11575 |
| Copyright terms: Public domain | W3C validator |