![]() |
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 10797 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 2941 | . . . 4 ⊢ (𝑘 = 𝑗 → 𝐶 = ⦋𝑗 / 𝑘⦌𝐶) | |
2 | nfcv 2228 | . . . 4 ⊢ Ⅎ𝑗𝑈 | |
3 | nfcv 2228 | . . . 4 ⊢ Ⅎ𝑘𝑈 | |
4 | nfcv 2228 | . . . 4 ⊢ Ⅎ𝑗𝐶 | |
5 | nfcsb1v 2963 | . . . 4 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 | |
6 | 1, 2, 3, 4, 5 | cbvsum 10745 | . . 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 1466 | . . . . . 6 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑈 | |
13 | 11, 12 | nfan 1502 | . . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ 𝑈) |
14 | 5 | nfel1 2239 | . . . . 5 ⊢ Ⅎ𝑘⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ |
15 | 13, 14 | nfim 1509 | . . . 4 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
16 | eleq1w 2148 | . . . . . 6 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ 𝑈 ↔ 𝑗 ∈ 𝑈)) | |
17 | 16 | anbi2d 452 | . . . . 5 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ 𝑈) ↔ (𝜑 ∧ 𝑗 ∈ 𝑈))) |
18 | 1 | eleq1d 2156 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐶 ∈ ℂ ↔ ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ)) |
19 | 17, 18 | imbi12d 232 | . . . 4 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) ↔ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ))) |
20 | fsumsplitf.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) | |
21 | 15, 19, 20 | chvar 1687 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑈) → ⦋𝑗 / 𝑘⦌𝐶 ∈ ℂ) |
22 | 8, 9, 10, 21 | fsumsplit 10797 | . 2 ⊢ (𝜑 → Σ𝑗 ∈ 𝑈 ⦋𝑗 / 𝑘⦌𝐶 = (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶)) |
23 | csbeq1a 2941 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶) | |
24 | csbco 2942 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = ⦋𝑘 / 𝑘⦌𝐶 | |
25 | csbid 2940 | . . . . . . . . 9 ⊢ ⦋𝑘 / 𝑘⦌𝐶 = 𝐶 | |
26 | 24, 25 | eqtri 2108 | . . . . . . . 8 ⊢ ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶 |
27 | 26 | a1i 9 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → ⦋𝑘 / 𝑗⦌⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
28 | 23, 27 | eqtrd 2120 | . . . . . 6 ⊢ (𝑗 = 𝑘 → ⦋𝑗 / 𝑘⦌𝐶 = 𝐶) |
29 | nfcv 2228 | . . . . . 6 ⊢ Ⅎ𝑘𝐴 | |
30 | nfcv 2228 | . . . . . 6 ⊢ Ⅎ𝑗𝐴 | |
31 | 28, 29, 30, 5, 4 | cbvsum 10745 | . . . . 5 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
32 | eqid 2088 | . . . . 5 ⊢ Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝐴 𝐶 | |
33 | 31, 32 | eqtri 2108 | . . . 4 ⊢ Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐴 𝐶 |
34 | 5, 4, 28 | cbvsumi 10747 | . . . 4 ⊢ Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶 = Σ𝑘 ∈ 𝐵 𝐶 |
35 | 33, 34 | oveq12i 5664 | . . 3 ⊢ (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶) |
36 | 35 | a1i 9 | . 2 ⊢ (𝜑 → (Σ𝑗 ∈ 𝐴 ⦋𝑗 / 𝑘⦌𝐶 + Σ𝑗 ∈ 𝐵 ⦋𝑗 / 𝑘⦌𝐶) = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
37 | 7, 22, 36 | 3eqtrd 2124 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1289 Ⅎwnf 1394 ∈ wcel 1438 ⦋csb 2933 ∪ cun 2997 ∩ cin 2998 ∅c0 3286 (class class class)co 5652 Fincfn 6455 ℂcc 7346 + caddc 7351 Σcsu 10738 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 579 ax-in2 580 ax-io 665 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-10 1441 ax-11 1442 ax-i12 1443 ax-bndl 1444 ax-4 1445 ax-13 1449 ax-14 1450 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 ax-coll 3954 ax-sep 3957 ax-nul 3965 ax-pow 4009 ax-pr 4036 ax-un 4260 ax-setind 4353 ax-iinf 4403 ax-cnex 7434 ax-resscn 7435 ax-1cn 7436 ax-1re 7437 ax-icn 7438 ax-addcl 7439 ax-addrcl 7440 ax-mulcl 7441 ax-mulrcl 7442 ax-addcom 7443 ax-mulcom 7444 ax-addass 7445 ax-mulass 7446 ax-distr 7447 ax-i2m1 7448 ax-0lt1 7449 ax-1rid 7450 ax-0id 7451 ax-rnegex 7452 ax-precex 7453 ax-cnre 7454 ax-pre-ltirr 7455 ax-pre-ltwlin 7456 ax-pre-lttrn 7457 ax-pre-apti 7458 ax-pre-ltadd 7459 ax-pre-mulgt0 7460 ax-pre-mulext 7461 ax-arch 7462 ax-caucvg 7463 |
This theorem depends on definitions: df-bi 115 df-dc 781 df-3or 925 df-3an 926 df-tru 1292 df-fal 1295 df-nf 1395 df-sb 1693 df-eu 1951 df-mo 1952 df-clab 2075 df-cleq 2081 df-clel 2084 df-nfc 2217 df-ne 2256 df-nel 2351 df-ral 2364 df-rex 2365 df-reu 2366 df-rmo 2367 df-rab 2368 df-v 2621 df-sbc 2841 df-csb 2934 df-dif 3001 df-un 3003 df-in 3005 df-ss 3012 df-nul 3287 df-if 3394 df-pw 3431 df-sn 3452 df-pr 3453 df-op 3455 df-uni 3654 df-int 3689 df-iun 3732 df-br 3846 df-opab 3900 df-mpt 3901 df-tr 3937 df-id 4120 df-po 4123 df-iso 4124 df-iord 4193 df-on 4195 df-ilim 4196 df-suc 4198 df-iom 4406 df-xp 4444 df-rel 4445 df-cnv 4446 df-co 4447 df-dm 4448 df-rn 4449 df-res 4450 df-ima 4451 df-iota 4980 df-fun 5017 df-fn 5018 df-f 5019 df-f1 5020 df-fo 5021 df-f1o 5022 df-fv 5023 df-isom 5024 df-riota 5608 df-ov 5655 df-oprab 5656 df-mpt2 5657 df-1st 5911 df-2nd 5912 df-recs 6070 df-irdg 6135 df-frec 6156 df-1o 6181 df-oadd 6185 df-er 6290 df-en 6456 df-dom 6457 df-fin 6458 df-pnf 7522 df-mnf 7523 df-xr 7524 df-ltxr 7525 df-le 7526 df-sub 7653 df-neg 7654 df-reap 8050 df-ap 8057 df-div 8138 df-inn 8421 df-2 8479 df-3 8480 df-4 8481 df-n0 8672 df-z 8749 df-uz 9018 df-q 9103 df-rp 9133 df-fz 9423 df-fzo 9550 df-iseq 9849 df-seq3 9850 df-exp 9951 df-ihash 10180 df-cj 10272 df-re 10273 df-im 10274 df-rsqrt 10427 df-abs 10428 df-clim 10663 df-isum 10739 |
This theorem is referenced by: fsumsplitsn 10800 |
Copyright terms: Public domain | W3C validator |