| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isum1p | 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 2231 | . . 3 ⊢ (ℤ≥‘(𝑀 + 1)) = (ℤ≥‘(𝑀 + 1)) | |
| 3 | isum1p.3 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | uzid 9769 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 5 | 3, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 6 | peano2uz 9816 | . . . . 5 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
| 7 | 5, 6 | syl 14 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
| 8 | 7, 1 | eleqtrrdi 2325 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ 𝑍) |
| 9 | isum1p.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
| 10 | isum1p.5 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) | |
| 11 | isum1p.6 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
| 12 | 1, 2, 8, 9, 10, 11 | isumsplit 12051 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = (Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
| 13 | 3 | zcnd 9602 | . . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
| 14 | ax-1cn 8124 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 15 | pncan 8384 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 + 1) − 1) = 𝑀) | |
| 16 | 13, 14, 15 | sylancl 413 | . . . . . 6 ⊢ (𝜑 → ((𝑀 + 1) − 1) = 𝑀) |
| 17 | 16 | oveq2d 6033 | . . . . 5 ⊢ (𝜑 → (𝑀...((𝑀 + 1) − 1)) = (𝑀...𝑀)) |
| 18 | 17 | sumeq1d 11926 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 = Σ𝑘 ∈ (𝑀...𝑀)𝐴) |
| 19 | elfzuz 10255 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑀) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 20 | 19, 1 | eleqtrrdi 2325 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑀) → 𝑘 ∈ 𝑍) |
| 21 | 20, 9 | sylan2 286 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑀)) → (𝐹‘𝑘) = 𝐴) |
| 22 | 21 | sumeq2dv 11928 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = Σ𝑘 ∈ (𝑀...𝑀)𝐴) |
| 23 | fveq2 5639 | . . . . . . 7 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀)) | |
| 24 | 23 | eleq1d 2300 | . . . . . 6 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ ℂ ↔ (𝐹‘𝑀) ∈ ℂ)) |
| 25 | 9, 10 | eqeltrd 2308 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
| 26 | 25 | ralrimiva 2605 | . . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℂ) |
| 27 | 5, 1 | eleqtrrdi 2325 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
| 28 | 24, 26, 27 | rspcdva 2915 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝑀) ∈ ℂ) |
| 29 | 23 | fsum1 11972 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ (𝐹‘𝑀) ∈ ℂ) → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = (𝐹‘𝑀)) |
| 30 | 3, 28, 29 | syl2anc 411 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)(𝐹‘𝑘) = (𝐹‘𝑀)) |
| 31 | 18, 22, 30 | 3eqtr2d 2270 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 = (𝐹‘𝑀)) |
| 32 | 31 | oveq1d 6032 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ (𝑀...((𝑀 + 1) − 1))𝐴 + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴) = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
| 33 | 12, 32 | eqtrd 2264 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ((𝐹‘𝑀) + Σ𝑘 ∈ (ℤ≥‘(𝑀 + 1))𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 dom cdm 4725 ‘cfv 5326 (class class class)co 6017 ℂcc 8029 1c1 8032 + caddc 8034 − cmin 8349 ℤcz 9478 ℤ≥cuz 9754 ...cfz 10242 seqcseq 10708 ⇝ cli 11838 Σcsu 11913 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 ax-arch 8150 ax-caucvg 8151 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-isom 5335 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-frec 6556 df-1o 6581 df-oadd 6585 df-er 6701 df-en 6909 df-dom 6910 df-fin 6911 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-n0 9402 df-z 9479 df-uz 9755 df-q 9853 df-rp 9888 df-fz 10243 df-fzo 10377 df-seqfrec 10709 df-exp 10800 df-ihash 11037 df-cj 11402 df-re 11403 df-im 11404 df-rsqrt 11558 df-abs 11559 df-clim 11839 df-sumdc 11914 |
| This theorem is referenced by: isumnn0nn 12053 efsep 12251 |
| Copyright terms: Public domain | W3C validator |