| 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 11913 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 3133 | . . . 4 ⊢ (𝑘 = 𝑗 → 𝐶 = ⦋𝑗 / 𝑘⦌𝐶) | |
| 2 | nfcv 2372 | . . . 4 ⊢ Ⅎ𝑗𝑈 | |
| 3 | nfcv 2372 | . . . 4 ⊢ Ⅎ𝑘𝑈 | |
| 4 | nfcv 2372 | . . . 4 ⊢ Ⅎ𝑗𝐶 | |
| 5 | nfcsb1v 3157 | . . . 4 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 | |
| 6 | 1, 2, 3, 4, 5 | cbvsum 11866 | . . 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 1574 | . . . . . 6 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑈 | |
| 13 | 11, 12 | nfan 1611 | . . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ 𝑈) |
| 14 | 5 | nfel1 2383 | . . . . 5 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ |
| 15 | 13, 14 | nfim 1618 | . . . 4 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
| 16 | eleq1w 2290 | . . . . . 6 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝑈 ↔ 𝑗 ∈ 𝑈)) | |
| 17 | 16 | anbi2d 464 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ 𝑈) ↔ (𝜑 ∧ 𝑗 ∈ 𝑈))) |
| 18 | 1 | eleq1d 2298 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐶 ∈ ℂ ↔ ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ)) |
| 19 | 17, 18 | imbi12d 234 | . . . 4 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) ↔ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ))) |
| 20 | fsumsplitf.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) | |
| 21 | 15, 19, 20 | chvar 1803 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
| 22 | 8, 9, 10, 21 | fsumsplit 11913 | . 2 ⊢ (𝜑 → Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶 = (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶)) |
| 23 | csbeq1a 3133 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶) | |
| 24 | csbco 3134 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑘⦌𝐶 | |
| 25 | csbid 3132 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑘⦌𝐶 = 𝐶 | |
| 26 | 24, 25 | eqtri 2250 | . . . . . . . 8 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶 |
| 27 | 26 | a1i 9 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
| 28 | 23, 27 | eqtrd 2262 | . . . . . 6 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
| 29 | nfcv 2372 | . . . . . 6 ⊢ Ⅎ𝑘𝐴 | |
| 30 | nfcv 2372 | . . . . . 6 ⊢ Ⅎ𝑗𝐴 | |
| 31 | 28, 29, 30, 5, 4 | cbvsum 11866 | . . . . 5 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
| 32 | eqid 2229 | . . . . 5 ⊢ Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝐴 𝐶 | |
| 33 | 31, 32 | eqtri 2250 | . . . 4 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
| 34 | 5, 4, 28 | cbvsumi 11868 | . . . 4 ⊢ Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐵 𝐶 |
| 35 | 33, 34 | oveq12i 6012 | . . 3 ⊢ (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶) |
| 36 | 35 | a1i 9 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| 37 | 7, 22, 36 | 3eqtrd 2266 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 Ⅎwnf 1506 ∈ wcel 2200 ⦋csb 3124 ∪ cun 3195 ∩ cin 3196 ∅c0 3491 (class class class)co 6000 Fincfn 6885 ℂcc 7993 + caddc 7998 Σcsu 11859 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-mulrcl 8094 ax-addcom 8095 ax-mulcom 8096 ax-addass 8097 ax-mulass 8098 ax-distr 8099 ax-i2m1 8100 ax-0lt1 8101 ax-1rid 8102 ax-0id 8103 ax-rnegex 8104 ax-precex 8105 ax-cnre 8106 ax-pre-ltirr 8107 ax-pre-ltwlin 8108 ax-pre-lttrn 8109 ax-pre-apti 8110 ax-pre-ltadd 8111 ax-pre-mulgt0 8112 ax-pre-mulext 8113 ax-arch 8114 ax-caucvg 8115 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-id 4383 df-po 4386 df-iso 4387 df-iord 4456 df-on 4458 df-ilim 4459 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-isom 5326 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-1st 6284 df-2nd 6285 df-recs 6449 df-irdg 6514 df-frec 6535 df-1o 6560 df-oadd 6564 df-er 6678 df-en 6886 df-dom 6887 df-fin 6888 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-sub 8315 df-neg 8316 df-reap 8718 df-ap 8725 df-div 8816 df-inn 9107 df-2 9165 df-3 9166 df-4 9167 df-n0 9366 df-z 9443 df-uz 9719 df-q 9811 df-rp 9846 df-fz 10201 df-fzo 10335 df-seqfrec 10665 df-exp 10756 df-ihash 10993 df-cj 11348 df-re 11349 df-im 11350 df-rsqrt 11504 df-abs 11505 df-clim 11785 df-sumdc 11860 |
| This theorem is referenced by: fsumsplitsn 11916 |
| Copyright terms: Public domain | W3C validator |