| 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 15658 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 2841 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀)) |
| 6 | peano2uz 12794 | . . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 + 1) ∈ (ℤ≥‘𝑀)) | |
| 7 | 6, 4 | eleqtrrdi 2842 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾 + 1) ∈ 𝑍) |
| 8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝐾 + 1) ∈ 𝑍) |
| 9 | 1, 8 | eqeltrid 2835 | . 2 ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
| 10 | 1 | oveq2i 7352 | . . . . 5 ⊢ (𝑀...𝑁) = (𝑀...(𝐾 + 1)) |
| 11 | 10 | sumeq1i 15599 | . . . 4 ⊢ Σ𝑘 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...(𝐾 + 1))𝐴 |
| 12 | elfzuz 13415 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...(𝐾 + 1)) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 13 | 12, 4 | eleqtrrdi 2842 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...(𝐾 + 1)) → 𝑘 ∈ 𝑍) |
| 14 | fsump1i.4 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) | |
| 15 | 13, 14 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝐾 + 1))) → 𝐴 ∈ ℂ) |
| 16 | 1 | eqeq2i 2744 | . . . . . 6 ⊢ (𝑘 = 𝑁 ↔ 𝑘 = (𝐾 + 1)) |
| 17 | fsump1i.3 | . . . . . 6 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵) | |
| 18 | 16, 17 | sylbir 235 | . . . . 5 ⊢ (𝑘 = (𝐾 + 1) → 𝐴 = 𝐵) |
| 19 | 5, 15, 18 | fsump1 15658 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...(𝐾 + 1))𝐴 = (Σ𝑘 ∈ (𝑀...𝐾)𝐴 + 𝐵)) |
| 20 | 11, 19 | eqtrid 2778 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (Σ𝑘 ∈ (𝑀...𝐾)𝐴 + 𝐵)) |
| 21 | 2 | simprd 495 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝐾)𝐴 = 𝑆) |
| 22 | 21 | oveq1d 7356 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (𝑀...𝐾)𝐴 + 𝐵) = (𝑆 + 𝐵)) |
| 23 | fsump1i.6 | . . 3 ⊢ (𝜑 → (𝑆 + 𝐵) = 𝑇) | |
| 24 | 20, 22, 23 | 3eqtrd 2770 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = 𝑇) |
| 25 | 9, 24 | jca 511 | 1 ⊢ (𝜑 → (𝑁 ∈ 𝑍 ∧ Σ𝑘 ∈ (𝑀...𝑁)𝐴 = 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ‘cfv 6476 (class class class)co 7341 ℂcc 10999 1c1 11002 + caddc 11004 ℤ≥cuz 12727 ...cfz 13402 Σcsu 15588 |
| 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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5212 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 ax-inf2 9526 ax-cnex 11057 ax-resscn 11058 ax-1cn 11059 ax-icn 11060 ax-addcl 11061 ax-addrcl 11062 ax-mulcl 11063 ax-mulrcl 11064 ax-mulcom 11065 ax-addass 11066 ax-mulass 11067 ax-distr 11068 ax-i2m1 11069 ax-1ne0 11070 ax-1rid 11071 ax-rnegex 11072 ax-rrecex 11073 ax-cnre 11074 ax-pre-lttri 11075 ax-pre-lttrn 11076 ax-pre-ltadd 11077 ax-pre-mulgt0 11078 ax-pre-sup 11079 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-int 4893 df-iun 4938 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-se 5565 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 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 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-1o 8380 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-fin 8868 df-sup 9321 df-oi 9391 df-card 9827 df-pnf 11143 df-mnf 11144 df-xr 11145 df-ltxr 11146 df-le 11147 df-sub 11341 df-neg 11342 df-div 11770 df-nn 12121 df-2 12183 df-3 12184 df-n0 12377 df-z 12464 df-uz 12728 df-rp 12886 df-fz 13403 df-fzo 13550 df-seq 13904 df-exp 13964 df-hash 14233 df-cj 15001 df-re 15002 df-im 15003 df-sqrt 15137 df-abs 15138 df-clim 15390 df-sum 15589 |
| This theorem is referenced by: cphipval 25165 itgcnlem 25713 vieta1 26242 ipval2 30679 subfacval2 35223 |
| Copyright terms: Public domain | W3C validator |