![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fsumsplit1 | Structured version Visualization version GIF version |
Description: Separate out a term in a finite sum. (Contributed by Glauco Siliprandi, 5-Apr-2020.) |
Ref | Expression |
---|---|
fsumsplit1.kph | ⊢ Ⅎ𝑘𝜑 |
fsumsplit1.kd | ⊢ Ⅎ𝑘𝐷 |
fsumsplit1.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
fsumsplit1.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
fsumsplit1.c | ⊢ (𝜑 → 𝐶 ∈ 𝐴) |
fsumsplit1.bd | ⊢ (𝑘 = 𝐶 → 𝐵 = 𝐷) |
Ref | Expression |
---|---|
fsumsplit1 | ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = (𝐷 + Σ𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uncom 4148 | . . . . 5 ⊢ ((𝐴 ∖ {𝐶}) ∪ {𝐶}) = ({𝐶} ∪ (𝐴 ∖ {𝐶})) | |
2 | 1 | a1i 11 | . . . 4 ⊢ (𝜑 → ((𝐴 ∖ {𝐶}) ∪ {𝐶}) = ({𝐶} ∪ (𝐴 ∖ {𝐶}))) |
3 | fsumsplit1.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝐴) | |
4 | 3 | snssd 4807 | . . . . 5 ⊢ (𝜑 → {𝐶} ⊆ 𝐴) |
5 | undif 4476 | . . . . 5 ⊢ ({𝐶} ⊆ 𝐴 ↔ ({𝐶} ∪ (𝐴 ∖ {𝐶})) = 𝐴) | |
6 | 4, 5 | sylib 217 | . . . 4 ⊢ (𝜑 → ({𝐶} ∪ (𝐴 ∖ {𝐶})) = 𝐴) |
7 | eqidd 2727 | . . . 4 ⊢ (𝜑 → 𝐴 = 𝐴) | |
8 | 2, 6, 7 | 3eqtrrd 2771 | . . 3 ⊢ (𝜑 → 𝐴 = ((𝐴 ∖ {𝐶}) ∪ {𝐶})) |
9 | 8 | sumeq1d 15653 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ ((𝐴 ∖ {𝐶}) ∪ {𝐶})𝐵) |
10 | fsumsplit1.kph | . . 3 ⊢ Ⅎ𝑘𝜑 | |
11 | fsumsplit1.kd | . . 3 ⊢ Ⅎ𝑘𝐷 | |
12 | fsumsplit1.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
13 | diffi 9181 | . . . 4 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ {𝐶}) ∈ Fin) | |
14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → (𝐴 ∖ {𝐶}) ∈ Fin) |
15 | neldifsnd 4791 | . . 3 ⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴 ∖ {𝐶})) | |
16 | simpl 482 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝐶})) → 𝜑) | |
17 | eldifi 4121 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ {𝐶}) → 𝑘 ∈ 𝐴) | |
18 | 17 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝐶})) → 𝑘 ∈ 𝐴) |
19 | fsumsplit1.b | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
20 | 16, 18, 19 | syl2anc 583 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝐶})) → 𝐵 ∈ ℂ) |
21 | fsumsplit1.bd | . . 3 ⊢ (𝑘 = 𝐶 → 𝐵 = 𝐷) | |
22 | 11 | a1i 11 | . . . . . 6 ⊢ (𝜑 → Ⅎ𝑘𝐷) |
23 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 = 𝐶) → 𝑘 = 𝐶) | |
24 | 23, 21 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐶) → 𝐵 = 𝐷) |
25 | 10, 22, 3, 24 | csbiedf 3919 | . . . . 5 ⊢ (𝜑 → ⦋𝐶 / 𝑘⦌𝐵 = 𝐷) |
26 | 25 | eqcomd 2732 | . . . 4 ⊢ (𝜑 → 𝐷 = ⦋𝐶 / 𝑘⦌𝐵) |
27 | 3 | ancli 548 | . . . . 5 ⊢ (𝜑 → (𝜑 ∧ 𝐶 ∈ 𝐴)) |
28 | nfcv 2897 | . . . . . 6 ⊢ Ⅎ𝑘𝐶 | |
29 | nfv 1909 | . . . . . . . 8 ⊢ Ⅎ𝑘 𝐶 ∈ 𝐴 | |
30 | 10, 29 | nfan 1894 | . . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ 𝐶 ∈ 𝐴) |
31 | 28 | nfcsb1 3912 | . . . . . . . 8 ⊢ Ⅎ𝑘⦋𝐶 / 𝑘⦌𝐵 |
32 | nfcv 2897 | . . . . . . . 8 ⊢ Ⅎ𝑘ℂ | |
33 | 31, 32 | nfel 2911 | . . . . . . 7 ⊢ Ⅎ𝑘⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ |
34 | 30, 33 | nfim 1891 | . . . . . 6 ⊢ Ⅎ𝑘((𝜑 ∧ 𝐶 ∈ 𝐴) → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ) |
35 | eleq1 2815 | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → (𝑘 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴)) | |
36 | 35 | anbi2d 628 | . . . . . . 7 ⊢ (𝑘 = 𝐶 → ((𝜑 ∧ 𝑘 ∈ 𝐴) ↔ (𝜑 ∧ 𝐶 ∈ 𝐴))) |
37 | csbeq1a 3902 | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → 𝐵 = ⦋𝐶 / 𝑘⦌𝐵) | |
38 | 37 | eleq1d 2812 | . . . . . . 7 ⊢ (𝑘 = 𝐶 → (𝐵 ∈ ℂ ↔ ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ)) |
39 | 36, 38 | imbi12d 344 | . . . . . 6 ⊢ (𝑘 = 𝐶 → (((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) ↔ ((𝜑 ∧ 𝐶 ∈ 𝐴) → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ))) |
40 | 28, 34, 39, 19 | vtoclgf 3552 | . . . . 5 ⊢ (𝐶 ∈ 𝐴 → ((𝜑 ∧ 𝐶 ∈ 𝐴) → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ)) |
41 | 3, 27, 40 | sylc 65 | . . . 4 ⊢ (𝜑 → ⦋𝐶 / 𝑘⦌𝐵 ∈ ℂ) |
42 | 26, 41 | eqeltrd 2827 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
43 | 10, 11, 14, 3, 15, 20, 21, 42 | fsumsplitsn 15696 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ ((𝐴 ∖ {𝐶}) ∪ {𝐶})𝐵 = (Σ𝑘 ∈ (𝐴 ∖ {𝐶})𝐵 + 𝐷)) |
44 | 10, 14, 20 | fsumclf 15690 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (𝐴 ∖ {𝐶})𝐵 ∈ ℂ) |
45 | 44, 42 | addcomd 11420 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ (𝐴 ∖ {𝐶})𝐵 + 𝐷) = (𝐷 + Σ𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
46 | 9, 43, 45 | 3eqtrd 2770 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = (𝐷 + Σ𝑘 ∈ (𝐴 ∖ {𝐶})𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 Ⅎwnf 1777 ∈ wcel 2098 Ⅎwnfc 2877 ⦋csb 3888 ∖ cdif 3940 ∪ cun 3941 ⊆ wss 3943 {csn 4623 (class class class)co 7405 Fincfn 8941 ℂcc 11110 + caddc 11115 Σcsu 15638 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-oi 9507 df-card 9936 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12981 df-fz 13491 df-fzo 13634 df-seq 13973 df-exp 14033 df-hash 14296 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-clim 15438 df-sum 15639 |
This theorem is referenced by: sticksstones22 41546 dvnmul 45236 etransclem35 45562 etransclem44 45571 |
Copyright terms: Public domain | W3C validator |