Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isum1p | Structured version Visualization version GIF version |
Description: The infinite sum of a converging infinite series equals the first term plus the infinite sum of the rest of it. (Contributed by NM, 2-Jan-2006.) (Revised by Mario Carneiro, 24-Apr-2014.) |
Ref | Expression |
---|---|
isum1p.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
isum1p.3 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
isum1p.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) |
isum1p.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) |
isum1p.6 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) |
Ref | Expression |
---|---|
isum1p | ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isum1p.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
2 | eqid 2823 | . . 3 ⊢ (ℤ≥‘(𝑀 + 1)) = (ℤ≥‘(𝑀 + 1)) | |
3 | isum1p.3 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
4 | uzid 12261 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
6 | peano2uz 12304 | . . . . 5 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
7 | 5, 6 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
8 | 7, 1 | eleqtrrdi 2926 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ 𝑍) |
9 | isum1p.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
10 | isum1p.5 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) | |
11 | isum1p.6 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
12 | 1, 2, 8, 9, 10, 11 | isumsplit 15197 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = (Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
13 | 3 | zcnd 12091 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
14 | ax-1cn 10597 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
15 | pncan 10894 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 + 1) − 1) = 𝑀) | |
16 | 13, 14, 15 | sylancl 588 | . . . . . 6 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀) |
17 | 16 | oveq2d 7174 | . . . . 5 ⊢ (𝜑 → (𝑀...((𝑀 + 1) − 1)) = (𝑀...𝑀)) |
18 | 17 | sumeq1d 15060 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 = Σ𝑘 ∈ (𝑀...𝑀)𝐴) |
19 | elfzuz 12907 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑀) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
20 | 19, 1 | eleqtrrdi 2926 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑀) → 𝑘 ∈ 𝑍) |
21 | 20, 9 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑀)) → (𝐹‘𝑘) = 𝐴) |
22 | 21 | sumeq2dv 15062 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = Σ𝑘 ∈ (𝑀...𝑀)𝐴) |
23 | fveq2 6672 | . . . . . . 7 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀)) | |
24 | 23 | eleq1d 2899 | . . . . . 6 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑀) ∈ ℂ)) |
25 | 9, 10 | eqeltrd 2915 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
26 | 25 | ralrimiva 3184 | . . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ) |
27 | 5, 1 | eleqtrrdi 2926 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
28 | 24, 26, 27 | rspcdva 3627 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℂ) |
29 | 23 | fsum1 15104 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ (𝐹‘𝑀) ∈ ℂ) → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = (𝐹‘𝑀)) |
30 | 3, 28, 29 | syl2anc 586 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = (𝐹‘𝑀)) |
31 | 18, 22, 30 | 3eqtr2d 2864 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 = (𝐹‘𝑀)) |
32 | 31 | oveq1d 7173 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴) = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
33 | 12, 32 | eqtrd 2858 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 dom cdm 5557 ‘cfv 6357 (class class class)co 7158 ℂcc 10537 1c1 10540 + caddc 10542 − cmin 10872 ℤcz 11984 ℤ≥cuz 12246 ...cfz 12895 seqcseq 13372 ⇝ cli 14843 Σcsu 15044 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-inf2 9106 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-oi 8976 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-fz 12896 df-fzo 13037 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-clim 14847 df-sum 15045 |
This theorem is referenced by: isumnn0nn 15199 efsep 15465 rpnnen2lem9 15577 binomcxplemnotnn0 40695 |
Copyright terms: Public domain | W3C validator |