![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fsumser | Structured version Visualization version GIF version |
Description: A finite sum expressed in terms of a partial sum of an infinite series. The recursive definition of follows as fsum1 14675 and fsump1i 14699, which should make our notation clear and from which, along with closure fsumcl 14663, we will derive the basic properties of finite sums. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 21-Apr-2014.) |
Ref | Expression |
---|---|
fsumser.1 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) = 𝐴) |
fsumser.2 | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
fsumser.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
Ref | Expression |
---|---|
fsumser | ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (seq𝑀( + , 𝐹)‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1w 2822 | . . . . . 6 ⊢ (𝑚 = 𝑘 → (𝑚 ∈ (𝑀...𝑁) ↔ 𝑘 ∈ (𝑀...𝑁))) | |
2 | fveq2 6352 | . . . . . 6 ⊢ (𝑚 = 𝑘 → (𝐹‘𝑚) = (𝐹‘𝑘)) | |
3 | 1, 2 | ifbieq1d 4253 | . . . . 5 ⊢ (𝑚 = 𝑘 → if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0) = if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0)) |
4 | eqid 2760 | . . . . 5 ⊢ (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)) = (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)) | |
5 | fvex 6362 | . . . . . 6 ⊢ (𝐹‘𝑘) ∈ V | |
6 | c0ex 10226 | . . . . . 6 ⊢ 0 ∈ V | |
7 | 5, 6 | ifex 4300 | . . . . 5 ⊢ if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0) ∈ V |
8 | 3, 4, 7 | fvmpt 6444 | . . . 4 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0)) |
9 | fsumser.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) = 𝐴) | |
10 | 9 | ifeq1da 4260 | . . . 4 ⊢ (𝜑 → if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0) = if(𝑘 ∈ (𝑀...𝑁), 𝐴, 0)) |
11 | 8, 10 | sylan9eqr 2816 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = if(𝑘 ∈ (𝑀...𝑁), 𝐴, 0)) |
12 | fsumser.2 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
13 | fsumser.3 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
14 | ssid 3765 | . . . 4 ⊢ (𝑀...𝑁) ⊆ (𝑀...𝑁) | |
15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ⊆ (𝑀...𝑁)) |
16 | 11, 12, 13, 15 | fsumsers 14658 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (seq𝑀( + , (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)))‘𝑁)) |
17 | elfzuz 12531 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
18 | 17, 8 | syl 17 | . . . . 5 ⊢ (𝑘 ∈ (𝑀...𝑁) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0)) |
19 | iftrue 4236 | . . . . 5 ⊢ (𝑘 ∈ (𝑀...𝑁) → if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0) = (𝐹‘𝑘)) | |
20 | 18, 19 | eqtrd 2794 | . . . 4 ⊢ (𝑘 ∈ (𝑀...𝑁) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = (𝐹‘𝑘)) |
21 | 20 | adantl 473 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = (𝐹‘𝑘)) |
22 | 12, 21 | seqfveq 13019 | . 2 ⊢ (𝜑 → (seq𝑀( + , (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)))‘𝑁) = (seq𝑀( + , 𝐹)‘𝑁)) |
23 | 16, 22 | eqtrd 2794 | 1 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (seq𝑀( + , 𝐹)‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1632 ∈ wcel 2139 ⊆ wss 3715 ifcif 4230 ↦ cmpt 4881 ‘cfv 6049 (class class class)co 6813 ℂcc 10126 0cc0 10128 + caddc 10131 ℤ≥cuz 11879 ...cfz 12519 seqcseq 12995 Σcsu 14615 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-inf2 8711 ax-cnex 10184 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205 ax-pre-sup 10206 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-int 4628 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-se 5226 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-isom 6058 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-om 7231 df-1st 7333 df-2nd 7334 df-wrecs 7576 df-recs 7637 df-rdg 7675 df-1o 7729 df-oadd 7733 df-er 7911 df-en 8122 df-dom 8123 df-sdom 8124 df-fin 8125 df-sup 8513 df-oi 8580 df-card 8955 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 df-div 10877 df-nn 11213 df-2 11271 df-3 11272 df-n0 11485 df-z 11570 df-uz 11880 df-rp 12026 df-fz 12520 df-fzo 12660 df-seq 12996 df-exp 13055 df-hash 13312 df-cj 14038 df-re 14039 df-im 14040 df-sqrt 14174 df-abs 14175 df-clim 14418 df-sum 14616 |
This theorem is referenced by: isumclim3 14689 seqabs 14745 cvgcmpce 14749 isumsplit 14771 climcndslem1 14780 climcndslem2 14781 climcnds 14782 trireciplem 14793 geolim 14800 geo2lim 14805 mertenslem2 14816 mertens 14817 efcvgfsum 15015 effsumlt 15040 prmreclem6 15827 prmrec 15828 ovollb2lem 23456 ovoliunlem1 23470 ovoliun2 23474 ovolscalem1 23481 ovolicc2lem4 23488 uniioovol 23547 uniioombllem3 23553 uniioombllem6 23556 mtest 24357 mtestbdd 24358 psercn2 24376 pserdvlem2 24381 abelthlem6 24389 logfac 24546 emcllem5 24925 lgamcvg2 24980 basellem8 25013 prmorcht 25103 pclogsum 25139 dchrisumlem2 25378 dchrmusum2 25382 dchrvmasumiflem1 25389 dchrisum0re 25401 dchrisum0lem1b 25403 dchrisum0lem2a 25405 dchrisum0lem2 25406 esumpcvgval 30449 esumcvg 30457 esumcvgsum 30459 knoppcnlem11 32799 fsumsermpt 40314 sumnnodd 40365 fourierdlem112 40938 sge0isum 41147 sge0seq 41166 |
Copyright terms: Public domain | W3C validator |