| 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 follows as fsum1 15783 and fsump1i 15805, which should make our notation clear and from which, along with closure fsumcl 15769, 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 2824 | . . . . . 6 ⊢ (𝑚 = 𝑘 → (𝑚 ∈ (𝑀...𝑁) ↔ 𝑘 ∈ (𝑀...𝑁))) | |
| 2 | fveq2 6906 | . . . . . 6 ⊢ (𝑚 = 𝑘 → (𝐹‘𝑚) = (𝐹‘𝑘)) | |
| 3 | 1, 2 | ifbieq1d 4550 | . . . . 5 ⊢ (𝑚 = 𝑘 → if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0) = if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0)) |
| 4 | eqid 2737 | . . . . 5 ⊢ (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)) = (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)) | |
| 5 | fvex 6919 | . . . . . 6 ⊢ (𝐹‘𝑘) ∈ V | |
| 6 | c0ex 11255 | . . . . . 6 ⊢ 0 ∈ V | |
| 7 | 5, 6 | ifex 4576 | . . . . 5 ⊢ if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0) ∈ V |
| 8 | 3, 4, 7 | fvmpt 7016 | . . . 4 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0)) |
| 9 | fsumser.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) = 𝐴) | |
| 10 | 9 | ifeq1da 4557 | . . . 4 ⊢ (𝜑 → if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0) = if(𝑘 ∈ (𝑀...𝑁), 𝐴, 0)) |
| 11 | 8, 10 | sylan9eqr 2799 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = if(𝑘 ∈ (𝑀...𝑁), 𝐴, 0)) |
| 12 | fsumser.2 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 13 | fsumser.3 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 14 | ssidd 4007 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ⊆ (𝑀...𝑁)) | |
| 15 | 11, 12, 13, 14 | fsumsers 15764 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (seq𝑀( + , (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)))‘𝑁)) |
| 16 | elfzuz 13560 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 17 | 16, 8 | syl 17 | . . . . 5 ⊢ (𝑘 ∈ (𝑀...𝑁) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0)) |
| 18 | iftrue 4531 | . . . . 5 ⊢ (𝑘 ∈ (𝑀...𝑁) → if(𝑘 ∈ (𝑀...𝑁), (𝐹‘𝑘), 0) = (𝐹‘𝑘)) | |
| 19 | 17, 18 | eqtrd 2777 | . . . 4 ⊢ (𝑘 ∈ (𝑀...𝑁) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = (𝐹‘𝑘)) |
| 20 | 19 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0))‘𝑘) = (𝐹‘𝑘)) |
| 21 | 12, 20 | seqfveq 14067 | . 2 ⊢ (𝜑 → (seq𝑀( + , (𝑚 ∈ (ℤ≥‘𝑀) ↦ if(𝑚 ∈ (𝑀...𝑁), (𝐹‘𝑚), 0)))‘𝑁) = (seq𝑀( + , 𝐹)‘𝑁)) |
| 22 | 15, 21 | eqtrd 2777 | 1 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (seq𝑀( + , 𝐹)‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ifcif 4525 ↦ cmpt 5225 ‘cfv 6561 (class class class)co 7431 ℂcc 11153 0cc0 11155 + caddc 11158 ℤ≥cuz 12878 ...cfz 13547 seqcseq 14042 Σcsu 15722 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-inf2 9681 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 ax-pre-sup 11233 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-sup 9482 df-oi 9550 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-div 11921 df-nn 12267 df-2 12329 df-3 12330 df-n0 12527 df-z 12614 df-uz 12879 df-rp 13035 df-fz 13548 df-fzo 13695 df-seq 14043 df-exp 14103 df-hash 14370 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-clim 15524 df-sum 15723 |
| This theorem is referenced by: isumclim3 15795 seqabs 15850 cvgcmpce 15854 isumsplit 15876 climcndslem1 15885 climcndslem2 15886 climcnds 15887 trireciplem 15898 geolim 15906 geo2lim 15911 mertenslem2 15921 mertens 15922 efcvgfsum 16122 effsumlt 16147 prmreclem6 16959 prmrec 16960 ovollb2lem 25523 ovoliunlem1 25537 ovoliun2 25541 ovolscalem1 25548 ovolicc2lem4 25555 uniioovol 25614 uniioombllem3 25620 uniioombllem6 25623 mtest 26447 mtestbdd 26448 psercn2 26466 psercn2OLD 26467 pserdvlem2 26472 abelthlem6 26480 logfac 26643 emcllem5 27043 lgamcvg2 27098 basellem8 27131 prmorcht 27221 pclogsum 27259 dchrisumlem2 27534 dchrmusum2 27538 dchrvmasumiflem1 27545 dchrisum0re 27557 dchrisum0lem1b 27559 dchrisum0lem2a 27561 dchrisum0lem2 27562 esumpcvgval 34079 esumcvg 34087 esumcvgsum 34089 knoppcnlem11 36504 fsumsermpt 45594 sumnnodd 45645 fourierdlem112 46233 sge0isum 46442 sge0seq 46461 |
| Copyright terms: Public domain | W3C validator |