| 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 2229 | . 2 ⊢ (ℤ≥‘𝑁) = (ℤ≥‘𝑁) | |
| 2 | climub.2 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | clim2iser.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrdi 2322 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzelz 9743 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fveq2 5629 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 8 | 7 | eleq1d 2298 | . . . . 5 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑁) ∈ ℝ)) |
| 9 | 8 | imbi2d 230 | . . . 4 ⊢ (𝑘 = 𝑁 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑁) ∈ ℝ))) |
| 10 | climub.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) | |
| 11 | 10 | expcom 116 | . . . 4 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → (𝐹‘𝑘) ∈ ℝ)) |
| 12 | 9, 11 | vtoclga 2867 | . . 3 ⊢ (𝑁 ∈ 𝑍 → (𝜑 → (𝐹‘𝑁) ∈ ℝ)) |
| 13 | 2, 12 | mpcom 36 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ) |
| 14 | climub.3 | . 2 ⊢ (𝜑 → 𝐹 ⇝ 𝐴) | |
| 15 | 3 | uztrn2 9752 | . . . 4 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 16 | 2, 15 | sylan 283 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ 𝑍) |
| 17 | fveq2 5629 | . . . . . . 7 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
| 18 | 17 | eleq1d 2298 | . . . . . 6 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘𝑗) ∈ ℝ)) |
| 19 | 18 | imbi2d 230 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘𝑗) ∈ ℝ))) |
| 20 | 19, 11 | vtoclga 2867 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (𝜑 → (𝐹‘𝑗) ∈ ℝ)) |
| 21 | 20 | impcom 125 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ) |
| 22 | 16, 21 | syldan 282 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑗) ∈ ℝ) |
| 23 | simpr 110 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → 𝑗 ∈ (ℤ≥‘𝑁)) | |
| 24 | elfzuz 10229 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...𝑗) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
| 25 | 3 | uztrn2 9752 | . . . . . . 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 10229 | . . . . 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 10719 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝑁)) → (𝐹‘𝑁) ≤ (𝐹‘𝑗)) |
| 36 | 1, 6, 13, 14, 22, 35 | climlec2 11867 | 1 ⊢ (𝜑 → (𝐹‘𝑁) ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 class class class wbr 4083 ‘cfv 5318 (class class class)co 6007 ℝcr 8009 1c1 8011 + caddc 8013 ≤ cle 8193 − cmin 8328 ℤcz 9457 ℤ≥cuz 9733 ...cfz 10216 ⇝ cli 11804 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 ax-arch 8129 ax-caucvg 8130 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-n0 9381 df-z 9458 df-uz 9734 df-rp 9862 df-fz 10217 df-seqfrec 10682 df-exp 10773 df-cj 11368 df-re 11369 df-im 11370 df-rsqrt 11524 df-abs 11525 df-clim 11805 |
| This theorem is referenced by: climserle 11871 |
| Copyright terms: Public domain | W3C validator |