| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > clim2ser | Structured version Visualization version GIF version | ||
| Description: The limit of an infinite series with an initial segment removed. (Contributed by Paul Chapman, 9-Feb-2008.) (Revised by Mario Carneiro, 1-Feb-2014.) |
| Ref | Expression |
|---|---|
| clim2ser.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| clim2ser.2 | ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
| clim2ser.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
| clim2ser.5 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) |
| Ref | Expression |
|---|---|
| clim2ser | ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹) ⇝ (𝐴 − (seq𝑀( + , 𝐹)‘𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . 2 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
| 2 | clim2ser.2 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
| 3 | clim2ser.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrdi 2870 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | peano2uz 12950 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) |
| 7 | eluzelz 12897 | . . 3 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ ℤ) | |
| 8 | 6, 7 | syl 18 | . 2 ⊢ (𝜑 → (𝑁 + 1) ∈ ℤ) |
| 9 | clim2ser.5 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) | |
| 10 | eluzel2 12892 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 11 | 4, 10 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 12 | clim2ser.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 13 | 3, 11, 12 | serf 14094 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 14 | 13, 2 | ffvelcdmd 7078 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ∈ ℂ) |
| 15 | seqex 14067 | . . 3 ⊢ seq(𝑁 + 1)( + , 𝐹) ∈ V | |
| 16 | 15 | a1i 11 | . 2 ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹) ∈ V) |
| 17 | 13 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 18 | 6, 3 | eleqtrrdi 2871 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ 𝑍) |
| 19 | 3 | uztrn2 12906 | . . . 4 ⊢ (((𝑁 + 1) ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑗 ∈ 𝑍) |
| 20 | 18, 19 | sylan 592 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑗 ∈ 𝑍) |
| 21 | 17, 20 | ffvelcdmd 7078 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ℂ) |
| 22 | addcl 11206 | . . . . . 6 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 + 𝑥) ∈ ℂ) | |
| 23 | 22 | adantl 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 + 𝑥) ∈ ℂ) |
| 24 | addass 11211 | . . . . . 6 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑘 + 𝑥) + 𝑦) = (𝑘 + (𝑥 + 𝑦))) | |
| 25 | 24 | adantl 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → ((𝑘 + 𝑥) + 𝑦) = (𝑘 + (𝑥 + 𝑦))) |
| 26 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) | |
| 27 | 4 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 28 | elfzuz 13574 | . . . . . . . 8 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 29 | 28, 3 | eleqtrrdi 2871 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ 𝑍) |
| 30 | 29, 12 | sylan2 605 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℂ) |
| 31 | 30 | adantlr 728 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℂ) |
| 32 | 23, 25, 26, 27, 31 | seqsplit 14099 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq𝑀( + , 𝐹)‘𝑗) = ((seq𝑀( + , 𝐹)‘𝑁) + (seq(𝑁 + 1)( + , 𝐹)‘𝑗))) |
| 33 | 32 | oveq1d 7428 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → ((seq𝑀( + , 𝐹)‘𝑗) − (seq𝑀( + , 𝐹)‘𝑁)) = (((seq𝑀( + , 𝐹)‘𝑁) + (seq(𝑁 + 1)( + , 𝐹)‘𝑗)) − (seq𝑀( + , 𝐹)‘𝑁))) |
| 34 | 14 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq𝑀( + , 𝐹)‘𝑁) ∈ ℂ) |
| 35 | 3 | uztrn2 12906 | . . . . . . . 8 ⊢ (((𝑁 + 1) ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑘 ∈ 𝑍) |
| 36 | 18, 35 | sylan 592 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑘 ∈ 𝑍) |
| 37 | 36, 12 | syldan 603 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → (𝐹‘𝑘) ∈ ℂ) |
| 38 | 1, 8, 37 | serf 14094 | . . . . 5 ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹):(ℤ≥‘(𝑁 + 1))⟶ℂ) |
| 39 | 38 | ffvelcdmda 7077 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq(𝑁 + 1)( + , 𝐹)‘𝑗) ∈ ℂ) |
| 40 | 34, 39 | pncan2d 11595 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (((seq𝑀( + , 𝐹)‘𝑁) + (seq(𝑁 + 1)( + , 𝐹)‘𝑗)) − (seq𝑀( + , 𝐹)‘𝑁)) = (seq(𝑁 + 1)( + , 𝐹)‘𝑗)) |
| 41 | 33, 40 | eqtr2d 2796 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq(𝑁 + 1)( + , 𝐹)‘𝑗) = ((seq𝑀( + , 𝐹)‘𝑗) − (seq𝑀( + , 𝐹)‘𝑁))) |
| 42 | 1, 8, 9, 14, 16, 21, 41 | climsubc1 15725 | 1 ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹) ⇝ (𝐴 − (seq𝑀( + , 𝐹)‘𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 class class class wbr 5103 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 ℂcc 11122 1c1 11125 + caddc 11127 − cmin 11465 ℤcz 12615 ℤ≥cuz 12887 ...cfz 13561 seqcseq 14065 ⇝ cli 15571 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-fz 13562 df-seq 14066 df-exp 14126 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-clim 15575 |
| This theorem is used by: iserex 15744 ege2le3 16176 abelthlem9 26676 stirlinglem7 46908 stirlinglem11 46912 stirlinglem12 46913 |
| Copyright terms: Public domain | W3C validator |