| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsump1i | Structured version Visualization version GIF version | ||
| Description: Optimized version of fsump1 15650 for making sums of a concrete number of terms. (Contributed by Mario Carneiro, 23-Apr-2014.) |
| Ref | Expression |
|---|---|
| fsump1i.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| fsump1i.2 | ⊢ 𝑁 = (𝐾 + 1) |
| fsump1i.3 | ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵) |
| fsump1i.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) |
| fsump1i.5 | ⊢ (𝜑 → (𝐾 ∈ 𝑍 ∧ Σ𝑘 ∈ (𝑀...𝐾)𝐴 = 𝑆)) |
| fsump1i.6 | ⊢ (𝜑 → (𝑆 + 𝐵) = 𝑇) |
| Ref | Expression |
|---|---|
| fsump1i | ⊢ (𝜑 → (𝑁 ∈ 𝑍 ∧ Σ𝑘 ∈ (𝑀...𝑁)𝐴 = 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fsump1i.2 | . . 3 ⊢ 𝑁 = (𝐾 + 1) | |
| 2 | fsump1i.5 | . . . . . 6 ⊢ (𝜑 → (𝐾 ∈ 𝑍 ∧ Σ𝑘 ∈ (𝑀...𝐾)𝐴 = 𝑆)) | |
| 3 | 2 | simpld 494 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑍) |
| 4 | fsump1i.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 5 | 3, 4 | eleqtrdi 2838 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀)) |
| 6 | peano2uz 12790 | . . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 + 1) ∈ (ℤ≥‘𝑀)) | |
| 7 | 6, 4 | eleqtrrdi 2839 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 + 1) ∈ 𝑍) |
| 8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝐾 + 1) ∈ 𝑍) |
| 9 | 1, 8 | eqeltrid 2832 | . 2 ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
| 10 | 1 | oveq2i 7351 | . . . . 5 ⊢ (𝑀...𝑁) = (𝑀...(𝐾 + 1)) |
| 11 | 10 | sumeq1i 15591 | . . . 4 ⊢ Σ𝑘 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...(𝐾 + 1))𝐴 |
| 12 | elfzuz 13411 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...(𝐾 + 1)) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 13 | 12, 4 | eleqtrrdi 2839 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...(𝐾 + 1)) → 𝑘 ∈ 𝑍) |
| 14 | fsump1i.4 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) | |
| 15 | 13, 14 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝐾 + 1))) → 𝐴 ∈ ℂ) |
| 16 | 1 | eqeq2i 2742 | . . . . . 6 ⊢ (𝑘 = 𝑁 ↔ 𝑘 = (𝐾 + 1)) |
| 17 | fsump1i.3 | . . . . . 6 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵) | |
| 18 | 16, 17 | sylbir 235 | . . . . 5 ⊢ (𝑘 = (𝐾 + 1) → 𝐴 = 𝐵) |
| 19 | 5, 15, 18 | fsump1 15650 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...(𝐾 + 1))𝐴 = (Σ𝑘 ∈ (𝑀...𝐾)𝐴 + 𝐵)) |
| 20 | 11, 19 | eqtrid 2776 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (Σ𝑘 ∈ (𝑀...𝐾)𝐴 + 𝐵)) |
| 21 | 2 | simprd 495 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝐾)𝐴 = 𝑆) |
| 22 | 21 | oveq1d 7355 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (𝑀...𝐾)𝐴 + 𝐵) = (𝑆 + 𝐵)) |
| 23 | fsump1i.6 | . . 3 ⊢ (𝜑 → (𝑆 + 𝐵) = 𝑇) | |
| 24 | 20, 22, 23 | 3eqtrd 2768 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = 𝑇) |
| 25 | 9, 24 | jca 511 | 1 ⊢ (𝜑 → (𝑁 ∈ 𝑍 ∧ Σ𝑘 ∈ (𝑀...𝑁)𝐴 = 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ‘cfv 6476 (class class class)co 7340 ℂcc 10995 1c1 10998 + caddc 11000 ℤ≥cuz 12723 ...cfz 13398 Σcsu 15580 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5214 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5367 ax-un 7662 ax-inf2 9525 ax-cnex 11053 ax-resscn 11054 ax-1cn 11055 ax-icn 11056 ax-addcl 11057 ax-addrcl 11058 ax-mulcl 11059 ax-mulrcl 11060 ax-mulcom 11061 ax-addass 11062 ax-mulass 11063 ax-distr 11064 ax-i2m1 11065 ax-1ne0 11066 ax-1rid 11067 ax-rnegex 11068 ax-rrecex 11069 ax-cnre 11070 ax-pre-lttri 11071 ax-pre-lttrn 11072 ax-pre-ltadd 11073 ax-pre-mulgt0 11074 ax-pre-sup 11075 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3393 df-v 3435 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4895 df-iun 4940 df-br 5089 df-opab 5151 df-mpt 5170 df-tr 5196 df-id 5508 df-eprel 5513 df-po 5521 df-so 5522 df-fr 5566 df-se 5567 df-we 5568 df-xp 5619 df-rel 5620 df-cnv 5621 df-co 5622 df-dm 5623 df-rn 5624 df-res 5625 df-ima 5626 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-isom 6485 df-riota 7297 df-ov 7343 df-oprab 7344 df-mpo 7345 df-om 7791 df-1st 7915 df-2nd 7916 df-frecs 8205 df-wrecs 8236 df-recs 8285 df-rdg 8323 df-1o 8379 df-er 8616 df-en 8864 df-dom 8865 df-sdom 8866 df-fin 8867 df-sup 9320 df-oi 9390 df-card 9823 df-pnf 11139 df-mnf 11140 df-xr 11141 df-ltxr 11142 df-le 11143 df-sub 11337 df-neg 11338 df-div 11766 df-nn 12117 df-2 12179 df-3 12180 df-n0 12373 df-z 12460 df-uz 12724 df-rp 12882 df-fz 13399 df-fzo 13546 df-seq 13897 df-exp 13957 df-hash 14226 df-cj 14993 df-re 14994 df-im 14995 df-sqrt 15129 df-abs 15130 df-clim 15382 df-sum 15581 |
| This theorem is referenced by: cphipval 25124 itgcnlem 25672 vieta1 26201 ipval2 30638 subfacval2 35177 |
| Copyright terms: Public domain | W3C validator |