| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fsum1p | GIF version | ||
| Description: Separate out the first term in a finite sum. (Contributed by NM, 3-Jan-2006.) (Revised by Mario Carneiro, 23-Apr-2014.) |
| Ref | Expression |
|---|---|
| fsumm1.1 | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| fsumm1.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) |
| fsum1p.3 | ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| fsum1p | ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fsumm1.1 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 2 | eluzel2 9821 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 3 | 1, 2 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 4 | fzsn 10363 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀}) | |
| 5 | 3, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (𝑀...𝑀) = {𝑀}) |
| 6 | 5 | ineq1d 3409 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ({𝑀} ∩ ((𝑀 + 1)...𝑁))) |
| 7 | 3 | zred 9663 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 8 | 7 | ltp1d 9169 | . . . . 5 ⊢ (𝜑 → 𝑀 < (𝑀 + 1)) |
| 9 | fzdisj 10349 | . . . . 5 ⊢ (𝑀 < (𝑀 + 1) → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) | |
| 10 | 8, 9 | syl 14 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 11 | 6, 10 | eqtr3d 2266 | . . 3 ⊢ (𝜑 → ({𝑀} ∩ ((𝑀 + 1)...𝑁)) = ∅) |
| 12 | eluzfz1 10328 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) | |
| 13 | 1, 12 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁)) |
| 14 | fzsplit 10348 | . . . . 5 ⊢ (𝑀 ∈ (𝑀...𝑁) → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁))) |
| 16 | 5 | uneq1d 3362 | . . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 17 | 15, 16 | eqtrd 2264 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁))) |
| 18 | eluzelz 9826 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 19 | 1, 18 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 20 | 3, 19 | fzfigd 10756 | . . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin) |
| 21 | fsumm1.2 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ) | |
| 22 | 11, 17, 20, 21 | fsumsplit 12048 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (Σ𝑘 ∈ {𝑀}𝐴 + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 23 | fsum1p.3 | . . . . . 6 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵) | |
| 24 | 23 | eleq1d 2300 | . . . . 5 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ)) |
| 25 | 21 | ralrimiva 2606 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ) |
| 26 | 24, 25, 13 | rspcdva 2916 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 27 | 23 | sumsn 12052 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝐵 ∈ ℂ) → Σ𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 28 | 3, 26, 27 | syl2anc 411 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐴 = 𝐵) |
| 29 | 28 | oveq1d 6043 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ {𝑀}𝐴 + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴) = (𝐵 + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| 30 | 22, 29 | eqtrd 2264 | 1 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ∪ cun 3199 ∩ cin 3200 ∅c0 3496 {csn 3673 class class class wbr 4093 ‘cfv 5333 (class class class)co 6028 ℂcc 8090 1c1 8093 + caddc 8095 < clt 8273 ℤcz 9540 ℤ≥cuz 9816 ...cfz 10305 Σcsu 11993 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8183 ax-resscn 8184 ax-1cn 8185 ax-1re 8186 ax-icn 8187 ax-addcl 8188 ax-addrcl 8189 ax-mulcl 8190 ax-mulrcl 8191 ax-addcom 8192 ax-mulcom 8193 ax-addass 8194 ax-mulass 8195 ax-distr 8196 ax-i2m1 8197 ax-0lt1 8198 ax-1rid 8199 ax-0id 8200 ax-rnegex 8201 ax-precex 8202 ax-cnre 8203 ax-pre-ltirr 8204 ax-pre-ltwlin 8205 ax-pre-lttrn 8206 ax-pre-apti 8207 ax-pre-ltadd 8208 ax-pre-mulgt0 8209 ax-pre-mulext 8210 ax-arch 8211 ax-caucvg 8212 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-isom 5342 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-frec 6600 df-1o 6625 df-oadd 6629 df-er 6745 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8275 df-mnf 8276 df-xr 8277 df-ltxr 8278 df-le 8279 df-sub 8411 df-neg 8412 df-reap 8814 df-ap 8821 df-div 8912 df-inn 9203 df-2 9261 df-3 9262 df-4 9263 df-n0 9462 df-z 9541 df-uz 9817 df-q 9915 df-rp 9950 df-fz 10306 df-fzo 10440 df-seqfrec 10773 df-exp 10864 df-ihash 11101 df-cj 11482 df-re 11483 df-im 11484 df-rsqrt 11638 df-abs 11639 df-clim 11919 df-sumdc 11994 |
| This theorem is referenced by: telfsumo 12107 fsumparts 12111 arisum2 12140 |
| Copyright terms: Public domain | W3C validator |