![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clim2ser2 | Structured version Visualization version GIF version |
Description: The limit of an infinite series with an initial segment added. (Contributed by Paul Chapman, 9-Feb-2008.) (Revised by Mario Carneiro, 1-Feb-2014.) |
Ref | Expression |
---|---|
clim2ser.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
clim2ser.2 | ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
clim2ser.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
clim2ser2.5 | ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹) ⇝ 𝐴) |
Ref | Expression |
---|---|
clim2ser2 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ (𝐴 + (seq𝑀( + , 𝐹)‘𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2825 | . 2 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
2 | clim2ser.2 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
3 | clim2ser.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 2, 3 | syl6eleq 2916 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
5 | peano2uz 12030 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) |
7 | eluzelz 11985 | . . 3 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ ℤ) | |
8 | 6, 7 | syl 17 | . 2 ⊢ (𝜑 → (𝑁 + 1) ∈ ℤ) |
9 | clim2ser2.5 | . 2 ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹) ⇝ 𝐴) | |
10 | eluzel2 11980 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
11 | 4, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
12 | clim2ser.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
13 | 3, 11, 12 | serf 13130 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
14 | 13, 2 | ffvelrnd 6614 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ∈ ℂ) |
15 | seqex 13104 | . . 3 ⊢ seq𝑀( + , 𝐹) ∈ V | |
16 | 15 | a1i 11 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ V) |
17 | 6, 3 | syl6eleqr 2917 | . . . . . 6 ⊢ (𝜑 → (𝑁 + 1) ∈ 𝑍) |
18 | 3 | uztrn2 11993 | . . . . . 6 ⊢ (((𝑁 + 1) ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑘 ∈ 𝑍) |
19 | 17, 18 | sylan 575 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑘 ∈ 𝑍) |
20 | 19, 12 | syldan 585 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → (𝐹‘𝑘) ∈ ℂ) |
21 | 1, 8, 20 | serf 13130 | . . 3 ⊢ (𝜑 → seq(𝑁 + 1)( + , 𝐹):(ℤ≥‘(𝑁 + 1))⟶ℂ) |
22 | 21 | ffvelrnda 6613 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq(𝑁 + 1)( + , 𝐹)‘𝑗) ∈ ℂ) |
23 | 14 | adantr 474 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq𝑀( + , 𝐹)‘𝑁) ∈ ℂ) |
24 | addcl 10341 | . . . . 5 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑘 + 𝑥) ∈ ℂ) | |
25 | 24 | adantl 475 | . . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ)) → (𝑘 + 𝑥) ∈ ℂ) |
26 | addass 10346 | . . . . 5 ⊢ ((𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑘 + 𝑥) + 𝑦) = (𝑘 + (𝑥 + 𝑦))) | |
27 | 26 | adantl 475 | . . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) ∧ (𝑘 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → ((𝑘 + 𝑥) + 𝑦) = (𝑘 + (𝑥 + 𝑦))) |
28 | simpr 479 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) | |
29 | 4 | adantr 474 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑁 ∈ (ℤ≥‘𝑀)) |
30 | elfzuz 12638 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
31 | 30, 3 | syl6eleqr 2917 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ 𝑍) |
32 | 31, 12 | sylan2 586 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℂ) |
33 | 32 | adantlr 706 | . . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℂ) |
34 | 25, 27, 28, 29, 33 | seqsplit 13135 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq𝑀( + , 𝐹)‘𝑗) = ((seq𝑀( + , 𝐹)‘𝑁) + (seq(𝑁 + 1)( + , 𝐹)‘𝑗))) |
35 | 23, 22, 34 | comraddd 10576 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘(𝑁 + 1))) → (seq𝑀( + , 𝐹)‘𝑗) = ((seq(𝑁 + 1)( + , 𝐹)‘𝑗) + (seq𝑀( + , 𝐹)‘𝑁))) |
36 | 1, 8, 9, 14, 16, 22, 35 | climaddc1 14749 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ (𝐴 + (seq𝑀( + , 𝐹)‘𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∧ w3a 1111 = wceq 1656 ∈ wcel 2164 Vcvv 3414 class class class wbr 4875 ‘cfv 6127 (class class class)co 6910 ℂcc 10257 1c1 10260 + caddc 10262 ℤcz 11711 ℤ≥cuz 11975 ...cfz 12626 seqcseq 13102 ⇝ cli 14599 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4996 ax-sep 5007 ax-nul 5015 ax-pow 5067 ax-pr 5129 ax-un 7214 ax-inf2 8822 ax-cnex 10315 ax-resscn 10316 ax-1cn 10317 ax-icn 10318 ax-addcl 10319 ax-addrcl 10320 ax-mulcl 10321 ax-mulrcl 10322 ax-mulcom 10323 ax-addass 10324 ax-mulass 10325 ax-distr 10326 ax-i2m1 10327 ax-1ne0 10328 ax-1rid 10329 ax-rnegex 10330 ax-rrecex 10331 ax-cnre 10332 ax-pre-lttri 10333 ax-pre-lttrn 10334 ax-pre-ltadd 10335 ax-pre-mulgt0 10336 ax-pre-sup 10337 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3or 1112 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rmo 3125 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4147 df-if 4309 df-pw 4382 df-sn 4400 df-pr 4402 df-tp 4404 df-op 4406 df-uni 4661 df-iun 4744 df-br 4876 df-opab 4938 df-mpt 4955 df-tr 4978 df-id 5252 df-eprel 5257 df-po 5265 df-so 5266 df-fr 5305 df-we 5307 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-rn 5357 df-res 5358 df-ima 5359 df-pred 5924 df-ord 5970 df-on 5971 df-lim 5972 df-suc 5973 df-iota 6090 df-fun 6129 df-fn 6130 df-f 6131 df-f1 6132 df-fo 6133 df-f1o 6134 df-fv 6135 df-riota 6871 df-ov 6913 df-oprab 6914 df-mpt2 6915 df-om 7332 df-1st 7433 df-2nd 7434 df-wrecs 7677 df-recs 7739 df-rdg 7777 df-er 8014 df-en 8229 df-dom 8230 df-sdom 8231 df-sup 8623 df-pnf 10400 df-mnf 10401 df-xr 10402 df-ltxr 10403 df-le 10404 df-sub 10594 df-neg 10595 df-div 11017 df-nn 11358 df-2 11421 df-3 11422 df-n0 11626 df-z 11712 df-uz 11976 df-rp 12120 df-fz 12627 df-seq 13103 df-exp 13162 df-cj 14223 df-re 14224 df-im 14225 df-sqrt 14359 df-abs 14360 df-clim 14603 |
This theorem is referenced by: iserex 14771 abelthlem6 24596 abelthlem9 24600 leibpi 25089 |
Copyright terms: Public domain | W3C validator |