| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fsumsplitf | GIF version | ||
| Description: Split a sum into two parts. A version of fsumsplit 12199 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.) |
| Ref | Expression |
|---|---|
| fsumsplitf.ph | ⊢ Ⅎ𝑘𝜑 |
| fsumsplitf.ab | ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅) |
| fsumsplitf.u | ⊢ (𝜑 → 𝑈 = (𝐴 ∪ 𝐵)) |
| fsumsplitf.fi | ⊢ (𝜑 → 𝑈 ∈ Fin) |
| fsumsplitf.c | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) |
| Ref | Expression |
|---|---|
| fsumsplitf | ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | csbeq1a 3156 | . . . 4 ⊢ (𝑘 = 𝑗 → 𝐶 = ⦋𝑗 / 𝑘⦌𝐶) | |
| 2 | nfcv 2392 | . . . 4 ⊢ Ⅎ𝑗𝑈 | |
| 3 | nfcv 2392 | . . . 4 ⊢ Ⅎ𝑘𝑈 | |
| 4 | nfcv 2392 | . . . 4 ⊢ Ⅎ𝑗𝐶 | |
| 5 | nfcsb1v 3180 | . . . 4 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 | |
| 6 | 1, 2, 3, 4, 5 | cbvsum 12151 | . . 3 ⊢ Σ𝑘 ∈ 𝑈 𝐶 = Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶 |
| 7 | 6 | a1i 9 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶) |
| 8 | fsumsplitf.ab | . . 3 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅) | |
| 9 | fsumsplitf.u | . . 3 ⊢ (𝜑 → 𝑈 = (𝐴 ∪ 𝐵)) | |
| 10 | fsumsplitf.fi | . . 3 ⊢ (𝜑 → 𝑈 ∈ Fin) | |
| 11 | fsumsplitf.ph | . . . . . 6 ⊢ Ⅎ𝑘𝜑 | |
| 12 | nfv 1581 | . . . . . 6 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑈 | |
| 13 | 11, 12 | nfan 1618 | . . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ 𝑈) |
| 14 | 5 | nfel1 2403 | . . . . 5 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ |
| 15 | 13, 14 | nfim 1625 | . . . 4 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
| 16 | eleq1w 2299 | . . . . . 6 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝑈 ↔ 𝑗 ∈ 𝑈)) | |
| 17 | 16 | anbi2d 468 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ 𝑈) ↔ (𝜑 ∧ 𝑗 ∈ 𝑈))) |
| 18 | 1 | eleq1d 2307 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐶 ∈ ℂ ↔ ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ)) |
| 19 | 17, 18 | imbi12d 234 | . . . 4 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) ↔ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ))) |
| 20 | fsumsplitf.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) | |
| 21 | 15, 19, 20 | chvar 1810 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
| 22 | 8, 9, 10, 21 | fsumsplit 12199 | . 2 ⊢ (𝜑 → Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶 = (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶)) |
| 23 | csbeq1a 3156 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶) | |
| 24 | csbco 3157 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑘⦌𝐶 | |
| 25 | csbid 3155 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑘⦌𝐶 = 𝐶 | |
| 26 | 24, 25 | eqtri 2259 | . . . . . . . 8 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶 |
| 27 | 26 | a1i 9 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
| 28 | 23, 27 | eqtrd 2271 | . . . . . 6 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
| 29 | nfcv 2392 | . . . . . 6 ⊢ Ⅎ𝑘𝐴 | |
| 30 | nfcv 2392 | . . . . . 6 ⊢ Ⅎ𝑗𝐴 | |
| 31 | 28, 29, 30, 5, 4 | cbvsum 12151 | . . . . 5 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
| 32 | eqid 2238 | . . . . 5 ⊢ Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝐴 𝐶 | |
| 33 | 31, 32 | eqtri 2259 | . . . 4 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
| 34 | 5, 4, 28 | cbvsumi 12153 | . . . 4 ⊢ Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐵 𝐶 |
| 35 | 33, 34 | oveq12i 6100 | . . 3 ⊢ (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶) |
| 36 | 35 | a1i 9 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| 37 | 7, 22, 36 | 3eqtrd 2275 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 Ⅎwnf 1513 ∈ wcel 2209 ⦋csb 3147 ∪ cun 3218 ∩ cin 3219 ∅c0 3520 (class class class)co 6088 Fincfn 7026 ℂcc 8183 + caddc 8188 Σcsu 12144 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 ax-arch 8304 ax-caucvg 8305 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-oadd 6695 df-er 6811 df-en 7027 df-dom 7028 df-fin 7029 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-n0 9575 df-z 9656 df-uz 9938 df-q 10036 df-rp 10072 df-fz 10429 df-fzo 10567 df-seqfrec 10906 df-exp 10997 df-ihash 11237 df-cj 11629 df-re 11630 df-im 11631 df-rsqrt 11786 df-abs 11787 df-clim 12070 df-sumdc 12145 |
| This theorem is used by: fsumsplitsn 12202 |
| Copyright terms: Public domain | W3C validator |