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 2610 | . . 3 ⊢ (ℤ≥‘(𝑀 + 1)) = (ℤ≥‘(𝑀 + 1)) | |
3 | isum1p.3 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
4 | uzid 11578 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
6 | peano2uz 11617 | . . . . 5 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
7 | 5, 6 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
8 | 7, 1 | syl6eleqr 2699 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ 𝑍) |
9 | isum1p.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
10 | isum1p.5 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) | |
11 | isum1p.6 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
12 | 1, 2, 8, 9, 10, 11 | isumsplit 14411 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = (Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
13 | 3 | zcnd 11359 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
14 | ax-1cn 9873 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
15 | pncan 10166 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 + 1) − 1) = 𝑀) | |
16 | 13, 14, 15 | sylancl 693 | . . . . . 6 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀) |
17 | 16 | oveq2d 6565 | . . . . 5 ⊢ (𝜑 → (𝑀...((𝑀 + 1) − 1)) = (𝑀...𝑀)) |
18 | 17 | sumeq1d 14279 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 = Σ𝑘 ∈ (𝑀...𝑀)𝐴) |
19 | elfzuz 12209 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑀) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
20 | 19, 1 | syl6eleqr 2699 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑀) → 𝑘 ∈ 𝑍) |
21 | 20, 9 | sylan2 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑀)) → (𝐹‘𝑘) = 𝐴) |
22 | 21 | sumeq2dv 14281 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = Σ𝑘 ∈ (𝑀...𝑀)𝐴) |
23 | 5, 1 | syl6eleqr 2699 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
24 | 9, 10 | eqeltrd 2688 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
25 | 24 | ralrimiva 2949 | . . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ) |
26 | fveq2 6103 | . . . . . . . 8 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀)) | |
27 | 26 | eleq1d 2672 | . . . . . . 7 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑀) ∈ ℂ)) |
28 | 27 | rspcv 3278 | . . . . . 6 ⊢ (𝑀 ∈ 𝑍 → (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ → (𝐹‘𝑀) ∈ ℂ)) |
29 | 23, 25, 28 | sylc 63 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℂ) |
30 | 26 | fsum1 14320 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ (𝐹‘𝑀) ∈ ℂ) → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = (𝐹‘𝑀)) |
31 | 3, 29, 30 | syl2anc 691 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = (𝐹‘𝑀)) |
32 | 18, 22, 31 | 3eqtr2d 2650 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 = (𝐹‘𝑀)) |
33 | 32 | oveq1d 6564 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴) = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
34 | 12, 33 | eqtrd 2644 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 dom cdm 5038 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 1c1 9816 + caddc 9818 − cmin 10145 ℤcz 11254 ℤ≥cuz 11563 ...cfz 12197 seqcseq 12663 ⇝ cli 14063 Σcsu 14264 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-sum 14265 |
This theorem is referenced by: isumnn0nn 14413 efsep 14679 rpnnen2lem9 14790 binomcxplemnotnn0 37577 |
Copyright terms: Public domain | W3C validator |