| 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 12031 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 3137 | . . . 4 ⊢ (𝑘 = 𝑗 → 𝐶 = ⦋𝑗 / 𝑘⦌𝐶) | |
| 2 | nfcv 2375 | . . . 4 ⊢ Ⅎ𝑗𝑈 | |
| 3 | nfcv 2375 | . . . 4 ⊢ Ⅎ𝑘𝑈 | |
| 4 | nfcv 2375 | . . . 4 ⊢ Ⅎ𝑗𝐶 | |
| 5 | nfcsb1v 3161 | . . . 4 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 | |
| 6 | 1, 2, 3, 4, 5 | cbvsum 11983 | . . 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 1577 | . . . . . 6 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑈 | |
| 13 | 11, 12 | nfan 1614 | . . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ 𝑈) |
| 14 | 5 | nfel1 2386 | . . . . 5 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ |
| 15 | 13, 14 | nfim 1621 | . . . 4 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
| 16 | eleq1w 2292 | . . . . . 6 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝑈 ↔ 𝑗 ∈ 𝑈)) | |
| 17 | 16 | anbi2d 464 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ 𝑈) ↔ (𝜑 ∧ 𝑗 ∈ 𝑈))) |
| 18 | 1 | eleq1d 2300 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐶 ∈ ℂ ↔ ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ)) |
| 19 | 17, 18 | imbi12d 234 | . . . 4 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) ↔ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ))) |
| 20 | fsumsplitf.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) | |
| 21 | 15, 19, 20 | chvar 1805 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
| 22 | 8, 9, 10, 21 | fsumsplit 12031 | . 2 ⊢ (𝜑 → Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶 = (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶)) |
| 23 | csbeq1a 3137 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶) | |
| 24 | csbco 3138 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑘⦌𝐶 | |
| 25 | csbid 3136 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑘⦌𝐶 = 𝐶 | |
| 26 | 24, 25 | eqtri 2252 | . . . . . . . 8 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶 |
| 27 | 26 | a1i 9 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
| 28 | 23, 27 | eqtrd 2264 | . . . . . 6 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
| 29 | nfcv 2375 | . . . . . 6 ⊢ Ⅎ𝑘𝐴 | |
| 30 | nfcv 2375 | . . . . . 6 ⊢ Ⅎ𝑗𝐴 | |
| 31 | 28, 29, 30, 5, 4 | cbvsum 11983 | . . . . 5 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
| 32 | eqid 2231 | . . . . 5 ⊢ Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝐴 𝐶 | |
| 33 | 31, 32 | eqtri 2252 | . . . 4 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
| 34 | 5, 4, 28 | cbvsumi 11985 | . . . 4 ⊢ Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐵 𝐶 |
| 35 | 33, 34 | oveq12i 6040 | . . 3 ⊢ (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶) |
| 36 | 35 | a1i 9 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| 37 | 7, 22, 36 | 3eqtrd 2268 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 Ⅎwnf 1509 ∈ wcel 2202 ⦋csb 3128 ∪ cun 3199 ∩ cin 3200 ∅c0 3496 (class class class)co 6028 Fincfn 6952 ℂcc 8073 + caddc 8078 Σcsu 11976 |
| 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 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195 |
| 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 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-n0 9445 df-z 9524 df-uz 9800 df-q 9898 df-rp 9933 df-fz 10289 df-fzo 10423 df-seqfrec 10756 df-exp 10847 df-ihash 11084 df-cj 11465 df-re 11466 df-im 11467 df-rsqrt 11621 df-abs 11622 df-clim 11902 df-sumdc 11977 |
| This theorem is referenced by: fsumsplitsn 12034 |
| Copyright terms: Public domain | W3C validator |