![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fsumrev2 | Structured version Visualization version GIF version |
Description: Reversal of a finite sum. (Contributed by NM, 27-Nov-2005.) (Revised by Mario Carneiro, 13-Apr-2016.) |
Ref | Expression |
---|---|
fsumrev2.1 | ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
fsumrev2.2 | ⊢ (𝑗 = ((𝑀 + 𝑁) − 𝑘) → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
fsumrev2 | ⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sum0 15754 | . . . . 5 ⊢ Σ𝑗 ∈ ∅ 𝐴 = 0 | |
2 | sum0 15754 | . . . . 5 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0 | |
3 | 1, 2 | eqtr4i 2766 | . . . 4 ⊢ Σ𝑗 ∈ ∅ 𝐴 = Σ𝑘 ∈ ∅ 𝐵 |
4 | sumeq1 15722 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑗 ∈ ∅ 𝐴) | |
5 | sumeq1 15722 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → Σ𝑘 ∈ (𝑀...𝑁)𝐵 = Σ𝑘 ∈ ∅ 𝐵) | |
6 | 3, 4, 5 | 3eqtr4a 2801 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
7 | 6 | adantl 481 | . 2 ⊢ ((𝜑 ∧ (𝑀...𝑁) = ∅) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
8 | fzn0 13575 | . . 3 ⊢ ((𝑀...𝑁) ≠ ∅ ↔ 𝑁 ∈ (ℤ≥‘𝑀)) | |
9 | eluzel2 12881 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
10 | 9 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℤ) |
11 | eluzelz 12886 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
12 | 11 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ) |
13 | 10, 12 | zaddcld 12724 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝑀 + 𝑁) ∈ ℤ) |
14 | fsumrev2.1 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
15 | 14 | adantlr 715 | . . . . 5 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
16 | fsumrev2.2 | . . . . 5 ⊢ (𝑗 = ((𝑀 + 𝑁) − 𝑘) → 𝐴 = 𝐵) | |
17 | 13, 10, 12, 15, 16 | fsumrev 15812 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (((𝑀 + 𝑁) − 𝑁)...((𝑀 + 𝑁) − 𝑀))𝐵) |
18 | 10 | zcnd 12721 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℂ) |
19 | 12 | zcnd 12721 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℂ) |
20 | 18, 19 | pncand 11619 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((𝑀 + 𝑁) − 𝑁) = 𝑀) |
21 | 18, 19 | pncan2d 11620 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((𝑀 + 𝑁) − 𝑀) = 𝑁) |
22 | 20, 21 | oveq12d 7449 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (((𝑀 + 𝑁) − 𝑁)...((𝑀 + 𝑁) − 𝑀)) = (𝑀...𝑁)) |
23 | 22 | sumeq1d 15733 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → Σ𝑘 ∈ (((𝑀 + 𝑁) − 𝑁)...((𝑀 + 𝑁) − 𝑀))𝐵 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
24 | 17, 23 | eqtrd 2775 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
25 | 8, 24 | sylan2b 594 | . 2 ⊢ ((𝜑 ∧ (𝑀...𝑁) ≠ ∅) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
26 | 7, 25 | pm2.61dane 3027 | 1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∅c0 4339 ‘cfv 6563 (class class class)co 7431 ℂcc 11151 0cc0 11153 + caddc 11156 − cmin 11490 ℤcz 12611 ℤ≥cuz 12876 ...cfz 13544 Σcsu 15719 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-inf2 9679 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-fz 13545 df-fzo 13692 df-seq 14040 df-exp 14100 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-clim 15521 df-sum 15720 |
This theorem is referenced by: fsum0diag2 15816 efaddlem 16126 aareccl 26383 |
Copyright terms: Public domain | W3C validator |