| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > climserle | Structured version Visualization version GIF version | ||
| Description: The partial sums of a converging infinite series with nonnegative terms are bounded by its limit. (Contributed by NM, 27-Dec-2005.) (Revised by Mario Carneiro, 9-Feb-2014.) |
| Ref | Expression |
|---|---|
| clim2ser.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| climserle.2 | ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
| climserle.3 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) |
| climserle.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) |
| climserle.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (𝐹‘𝑘)) |
| Ref | Expression |
|---|---|
| climserle | ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ≤ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clim2ser.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | climserle.2 | . 2 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | climserle.3 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) | |
| 4 | 2, 1 | eleqtrdi 2847 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzel2 12768 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 7 | climserle.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) | |
| 8 | 1, 6, 7 | serfre 13966 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℝ) |
| 9 | 8 | ffvelcdmda 7038 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ℝ) |
| 10 | 1 | peano2uzs 12827 | . . . . 5 ⊢ (𝑗 ∈ 𝑍 → (𝑗 + 1) ∈ 𝑍) |
| 11 | fveq2 6842 | . . . . . . . . 9 ⊢ (𝑘 = (𝑗 + 1) → (𝐹‘𝑘) = (𝐹‘(𝑗 + 1))) | |
| 12 | 11 | breq2d 5112 | . . . . . . . 8 ⊢ (𝑘 = (𝑗 + 1) → (0 ≤ (𝐹‘𝑘) ↔ 0 ≤ (𝐹‘(𝑗 + 1)))) |
| 13 | 12 | imbi2d 340 | . . . . . . 7 ⊢ (𝑘 = (𝑗 + 1) → ((𝜑 → 0 ≤ (𝐹‘𝑘)) ↔ (𝜑 → 0 ≤ (𝐹‘(𝑗 + 1))))) |
| 14 | climserle.5 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (𝐹‘𝑘)) | |
| 15 | 14 | expcom 413 | . . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → 0 ≤ (𝐹‘𝑘))) |
| 16 | 13, 15 | vtoclga 3534 | . . . . . 6 ⊢ ((𝑗 + 1) ∈ 𝑍 → (𝜑 → 0 ≤ (𝐹‘(𝑗 + 1)))) |
| 17 | 16 | impcom 407 | . . . . 5 ⊢ ((𝜑 ∧ (𝑗 + 1) ∈ 𝑍) → 0 ≤ (𝐹‘(𝑗 + 1))) |
| 18 | 10, 17 | sylan2 594 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 0 ≤ (𝐹‘(𝑗 + 1))) |
| 19 | 11 | eleq1d 2822 | . . . . . . . . 9 ⊢ (𝑘 = (𝑗 + 1) → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘(𝑗 + 1)) ∈ ℝ)) |
| 20 | 19 | imbi2d 340 | . . . . . . . 8 ⊢ (𝑘 = (𝑗 + 1) → ((𝜑 → (𝐹‘𝑘) ∈ ℝ) ↔ (𝜑 → (𝐹‘(𝑗 + 1)) ∈ ℝ))) |
| 21 | 7 | expcom 413 | . . . . . . . 8 ⊢ (𝑘 ∈ 𝑍 → (𝜑 → (𝐹‘𝑘) ∈ ℝ)) |
| 22 | 20, 21 | vtoclga 3534 | . . . . . . 7 ⊢ ((𝑗 + 1) ∈ 𝑍 → (𝜑 → (𝐹‘(𝑗 + 1)) ∈ ℝ)) |
| 23 | 22 | impcom 407 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 + 1) ∈ 𝑍) → (𝐹‘(𝑗 + 1)) ∈ ℝ) |
| 24 | 10, 23 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘(𝑗 + 1)) ∈ ℝ) |
| 25 | 9, 24 | addge01d 11737 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (0 ≤ (𝐹‘(𝑗 + 1)) ↔ (seq𝑀( + , 𝐹)‘𝑗) ≤ ((seq𝑀( + , 𝐹)‘𝑗) + (𝐹‘(𝑗 + 1))))) |
| 26 | 18, 25 | mpbid 232 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ≤ ((seq𝑀( + , 𝐹)‘𝑗) + (𝐹‘(𝑗 + 1)))) |
| 27 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍) | |
| 28 | 27, 1 | eleqtrdi 2847 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ≥‘𝑀)) |
| 29 | seqp1 13951 | . . . 4 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑗 + 1)) = ((seq𝑀( + , 𝐹)‘𝑗) + (𝐹‘(𝑗 + 1)))) | |
| 30 | 28, 29 | syl 17 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘(𝑗 + 1)) = ((seq𝑀( + , 𝐹)‘𝑗) + (𝐹‘(𝑗 + 1)))) |
| 31 | 26, 30 | breqtrrd 5128 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ≤ (seq𝑀( + , 𝐹)‘(𝑗 + 1))) |
| 32 | 1, 2, 3, 9, 31 | climub 15597 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ≤ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 ≤ cle 11179 ℤcz 12500 ℤ≥cuz 12763 seqcseq 13936 ⇝ cli 15419 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-pm 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9357 df-inf 9358 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-fz 13436 df-fl 13724 df-seq 13937 df-exp 13997 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-clim 15423 df-rlim 15424 |
| This theorem is referenced by: isumrpcl 15778 ege2le3 16025 prmreclem6 16861 ioombl1lem4 25530 rge0scvg 34127 |
| Copyright terms: Public domain | W3C validator |