| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fisumrev2 | GIF version | ||
| Description: Reversal of a finite sum. (Contributed by NM, 27-Nov-2005.) (Revised by Mario Carneiro, 13-Apr-2016.) |
| Ref | Expression |
|---|---|
| fisumrev2.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| fisumrev2.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| fsumrev2.1 | ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
| fsumrev2.2 | ⊢ (𝑗 = ((𝑀 + 𝑁) − 𝑘) → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| fisumrev2 | ⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fisumrev2.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 2 | 1 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℤ) |
| 3 | fisumrev2.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 4 | 3 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → 𝑁 ∈ ℤ) |
| 5 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ 𝑁) | |
| 6 | eluz2 9761 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) | |
| 7 | 2, 4, 5, 6 | syl3anbrc 1207 | . . 3 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 8 | 1 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℤ) |
| 9 | 3 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ) |
| 10 | 8, 9 | zaddcld 9606 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝑀 + 𝑁) ∈ ℤ) |
| 11 | fsumrev2.1 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 12 | 11 | adantlr 477 | . . . . 5 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
| 13 | fsumrev2.2 | . . . . 5 ⊢ (𝑗 = ((𝑀 + 𝑁) − 𝑘) → 𝐴 = 𝐵) | |
| 14 | 10, 8, 9, 12, 13 | fsumrev 12009 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (((𝑀 + 𝑁) − 𝑁)...((𝑀 + 𝑁) − 𝑀))𝐵) |
| 15 | 8 | zcnd 9603 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℂ) |
| 16 | 9 | zcnd 9603 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℂ) |
| 17 | 15, 16 | pncand 8491 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((𝑀 + 𝑁) − 𝑁) = 𝑀) |
| 18 | 15, 16 | pncan2d 8492 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((𝑀 + 𝑁) − 𝑀) = 𝑁) |
| 19 | 17, 18 | oveq12d 6036 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (((𝑀 + 𝑁) − 𝑁)...((𝑀 + 𝑁) − 𝑀)) = (𝑀...𝑁)) |
| 20 | 19 | sumeq1d 11931 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → Σ𝑘 ∈ (((𝑀 + 𝑁) − 𝑁)...((𝑀 + 𝑁) − 𝑀))𝐵 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| 21 | 14, 20 | eqtrd 2264 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| 22 | 7, 21 | syldan 282 | . 2 ⊢ ((𝜑 ∧ 𝑀 ≤ 𝑁) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| 23 | fzn 10277 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) | |
| 24 | 1, 3, 23 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) |
| 25 | 24 | biimpa 296 | . . 3 ⊢ ((𝜑 ∧ 𝑁 < 𝑀) → (𝑀...𝑁) = ∅) |
| 26 | sum0 11954 | . . . . 5 ⊢ Σ𝑗 ∈ ∅ 𝐴 = 0 | |
| 27 | sum0 11954 | . . . . 5 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0 | |
| 28 | 26, 27 | eqtr4i 2255 | . . . 4 ⊢ Σ𝑗 ∈ ∅ 𝐴 = Σ𝑘 ∈ ∅ 𝐵 |
| 29 | sumeq1 11920 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑗 ∈ ∅ 𝐴) | |
| 30 | sumeq1 11920 | . . . 4 ⊢ ((𝑀...𝑁) = ∅ → Σ𝑘 ∈ (𝑀...𝑁)𝐵 = Σ𝑘 ∈ ∅ 𝐵) | |
| 31 | 28, 29, 30 | 3eqtr4a 2290 | . . 3 ⊢ ((𝑀...𝑁) = ∅ → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| 32 | 25, 31 | syl 14 | . 2 ⊢ ((𝜑 ∧ 𝑁 < 𝑀) → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| 33 | zlelttric 9524 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ 𝑁 < 𝑀)) | |
| 34 | 1, 3, 33 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ∨ 𝑁 < 𝑀)) |
| 35 | 22, 32, 34 | mpjaodan 805 | 1 ⊢ (𝜑 → Σ𝑗 ∈ (𝑀...𝑁)𝐴 = Σ𝑘 ∈ (𝑀...𝑁)𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 = wceq 1397 ∈ wcel 2202 ∅c0 3494 class class class wbr 4088 ‘cfv 5326 (class class class)co 6018 ℂcc 8030 0cc0 8032 + caddc 8035 < clt 8214 ≤ cle 8215 − cmin 8350 ℤcz 9479 ℤ≥cuz 9755 ...cfz 10243 Σcsu 11918 |
| 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 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 ax-caucvg 8152 |
| 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 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-irdg 6536 df-frec 6557 df-1o 6582 df-oadd 6586 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-q 9854 df-rp 9889 df-fz 10244 df-fzo 10378 df-seqfrec 10711 df-exp 10802 df-ihash 11039 df-cj 11407 df-re 11408 df-im 11409 df-rsqrt 11563 df-abs 11564 df-clim 11844 df-sumdc 11919 |
| This theorem is referenced by: fisum0diag2 12013 efaddlem 12240 |
| Copyright terms: Public domain | W3C validator |