![]() |
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 11553 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 3090 | . . . 4 ⊢ (𝑘 = 𝑗 → 𝐶 = ⦋𝑗 / 𝑘⦌𝐶) | |
2 | nfcv 2336 | . . . 4 ⊢ Ⅎ𝑗𝑈 | |
3 | nfcv 2336 | . . . 4 ⊢ Ⅎ𝑘𝑈 | |
4 | nfcv 2336 | . . . 4 ⊢ Ⅎ𝑗𝐶 | |
5 | nfcsb1v 3114 | . . . 4 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 | |
6 | 1, 2, 3, 4, 5 | cbvsum 11506 | . . 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 1539 | . . . . . 6 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑈 | |
13 | 11, 12 | nfan 1576 | . . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ 𝑈) |
14 | 5 | nfel1 2347 | . . . . 5 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ |
15 | 13, 14 | nfim 1583 | . . . 4 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
16 | eleq1w 2254 | . . . . . 6 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝑈 ↔ 𝑗 ∈ 𝑈)) | |
17 | 16 | anbi2d 464 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ 𝑈) ↔ (𝜑 ∧ 𝑗 ∈ 𝑈))) |
18 | 1 | eleq1d 2262 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐶 ∈ ℂ ↔ ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ)) |
19 | 17, 18 | imbi12d 234 | . . . 4 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) ↔ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ))) |
20 | fsumsplitf.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) | |
21 | 15, 19, 20 | chvar 1768 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
22 | 8, 9, 10, 21 | fsumsplit 11553 | . 2 ⊢ (𝜑 → Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶 = (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶)) |
23 | csbeq1a 3090 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶) | |
24 | csbco 3091 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑘⦌𝐶 | |
25 | csbid 3089 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑘⦌𝐶 = 𝐶 | |
26 | 24, 25 | eqtri 2214 | . . . . . . . 8 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶 |
27 | 26 | a1i 9 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
28 | 23, 27 | eqtrd 2226 | . . . . . 6 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
29 | nfcv 2336 | . . . . . 6 ⊢ Ⅎ𝑘𝐴 | |
30 | nfcv 2336 | . . . . . 6 ⊢ Ⅎ𝑗𝐴 | |
31 | 28, 29, 30, 5, 4 | cbvsum 11506 | . . . . 5 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
32 | eqid 2193 | . . . . 5 ⊢ Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝐴 𝐶 | |
33 | 31, 32 | eqtri 2214 | . . . 4 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
34 | 5, 4, 28 | cbvsumi 11508 | . . . 4 ⊢ Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐵 𝐶 |
35 | 33, 34 | oveq12i 5931 | . . 3 ⊢ (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶) |
36 | 35 | a1i 9 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
37 | 7, 22, 36 | 3eqtrd 2230 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 Ⅎwnf 1471 ∈ wcel 2164 ⦋csb 3081 ∪ cun 3152 ∩ cin 3153 ∅c0 3447 (class class class)co 5919 Fincfn 6796 ℂcc 7872 + caddc 7877 Σcsu 11499 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 ax-arch 7993 ax-caucvg 7994 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-po 4328 df-iso 4329 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-isom 5264 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-irdg 6425 df-frec 6446 df-1o 6471 df-oadd 6475 df-er 6589 df-en 6797 df-dom 6798 df-fin 6799 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-n0 9244 df-z 9321 df-uz 9596 df-q 9688 df-rp 9723 df-fz 10078 df-fzo 10212 df-seqfrec 10522 df-exp 10613 df-ihash 10850 df-cj 10989 df-re 10990 df-im 10991 df-rsqrt 11145 df-abs 11146 df-clim 11425 df-sumdc 11500 |
This theorem is referenced by: fsumsplitsn 11556 |
Copyright terms: Public domain | W3C validator |