Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fsumsplit | Structured version Visualization version GIF version |
Description: Split a sum into two parts. (Contributed by Mario Carneiro, 18-Aug-2013.) (Revised by Mario Carneiro, 22-Apr-2014.) |
Ref | Expression |
---|---|
fsumsplit.1 | ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅) |
fsumsplit.2 | ⊢ (𝜑 → 𝑈 = (𝐴 ∪ 𝐵)) |
fsumsplit.3 | ⊢ (𝜑 → 𝑈 ∈ Fin) |
fsumsplit.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) |
Ref | Expression |
---|---|
fsumsplit | ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssun1 4148 | . . . . 5 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
2 | fsumsplit.2 | . . . . 5 ⊢ (𝜑 → 𝑈 = (𝐴 ∪ 𝐵)) | |
3 | 1, 2 | sseqtrrid 4020 | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝑈) |
4 | 3 | sselda 3967 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝑈) |
5 | fsumsplit.4 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ) | |
6 | 4, 5 | syldan 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ) |
7 | 6 | ralrimiva 3182 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ) |
8 | fsumsplit.3 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ Fin) | |
9 | 8 | olcd 870 | . . . 4 ⊢ (𝜑 → (𝑈 ⊆ (ℤ≥‘0) ∨ 𝑈 ∈ Fin)) |
10 | sumss2 15077 | . . . 4 ⊢ (((𝐴 ⊆ 𝑈 ∧ ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ) ∧ (𝑈 ⊆ (ℤ≥‘0) ∨ 𝑈 ∈ Fin)) → Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐴, 𝐶, 0)) | |
11 | 3, 7, 9, 10 | syl21anc 835 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐴, 𝐶, 0)) |
12 | ssun2 4149 | . . . . 5 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵) | |
13 | 12, 2 | sseqtrrid 4020 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝑈) |
14 | 13 | sselda 3967 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝑈) |
15 | 14, 5 | syldan 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐶 ∈ ℂ) |
16 | 15 | ralrimiva 3182 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ) |
17 | sumss2 15077 | . . . 4 ⊢ (((𝐵 ⊆ 𝑈 ∧ ∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ) ∧ (𝑈 ⊆ (ℤ≥‘0) ∨ 𝑈 ∈ Fin)) → Σ𝑘 ∈ 𝐵 𝐶 = Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐵, 𝐶, 0)) | |
18 | 13, 16, 9, 17 | syl21anc 835 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ 𝐵 𝐶 = Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐵, 𝐶, 0)) |
19 | 11, 18 | oveq12d 7168 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶) = (Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐴, 𝐶, 0) + Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐵, 𝐶, 0))) |
20 | 0cn 10627 | . . . 4 ⊢ 0 ∈ ℂ | |
21 | ifcl 4511 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 0 ∈ ℂ) → if(𝑘 ∈ 𝐴, 𝐶, 0) ∈ ℂ) | |
22 | 5, 20, 21 | sylancl 588 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → if(𝑘 ∈ 𝐴, 𝐶, 0) ∈ ℂ) |
23 | ifcl 4511 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 0 ∈ ℂ) → if(𝑘 ∈ 𝐵, 𝐶, 0) ∈ ℂ) | |
24 | 5, 20, 23 | sylancl 588 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → if(𝑘 ∈ 𝐵, 𝐶, 0) ∈ ℂ) |
25 | 8, 22, 24 | fsumadd 15090 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = (Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐴, 𝐶, 0) + Σ𝑘 ∈ 𝑈 if(𝑘 ∈ 𝐵, 𝐶, 0))) |
26 | 2 | eleq2d 2898 | . . . . . 6 ⊢ (𝜑 → (𝑘 ∈ 𝑈 ↔ 𝑘 ∈ (𝐴 ∪ 𝐵))) |
27 | elun 4125 | . . . . . 6 ⊢ (𝑘 ∈ (𝐴 ∪ 𝐵) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵)) | |
28 | 26, 27 | syl6bb 289 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝑈 ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵))) |
29 | 28 | biimpa 479 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵)) |
30 | iftrue 4473 | . . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 → if(𝑘 ∈ 𝐴, 𝐶, 0) = 𝐶) | |
31 | 30 | adantl 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 ∈ 𝐴, 𝐶, 0) = 𝐶) |
32 | noel 4296 | . . . . . . . . . . 11 ⊢ ¬ 𝑘 ∈ ∅ | |
33 | elin 4169 | . . . . . . . . . . . 12 ⊢ (𝑘 ∈ (𝐴 ∩ 𝐵) ↔ (𝑘 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) | |
34 | fsumsplit.1 | . . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅) | |
35 | 34 | eleq2d 2898 | . . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (𝐴 ∩ 𝐵) ↔ 𝑘 ∈ ∅)) |
36 | 33, 35 | syl5rbbr 288 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ ∅ ↔ (𝑘 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵))) |
37 | 32, 36 | mtbii 328 | . . . . . . . . . 10 ⊢ (𝜑 → ¬ (𝑘 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) |
38 | imnan 402 | . . . . . . . . . 10 ⊢ ((𝑘 ∈ 𝐴 → ¬ 𝑘 ∈ 𝐵) ↔ ¬ (𝑘 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) | |
39 | 37, 38 | sylibr 236 | . . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → ¬ 𝑘 ∈ 𝐵)) |
40 | 39 | imp 409 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ¬ 𝑘 ∈ 𝐵) |
41 | 40 | iffalsed 4478 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 ∈ 𝐵, 𝐶, 0) = 0) |
42 | 31, 41 | oveq12d 7168 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = (𝐶 + 0)) |
43 | 6 | addid1d 10834 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐶 + 0) = 𝐶) |
44 | 42, 43 | eqtrd 2856 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = 𝐶) |
45 | 39 | con2d 136 | . . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ 𝐵 → ¬ 𝑘 ∈ 𝐴)) |
46 | 45 | imp 409 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ¬ 𝑘 ∈ 𝐴) |
47 | 46 | iffalsed 4478 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝐴, 𝐶, 0) = 0) |
48 | iftrue 4473 | . . . . . . . 8 ⊢ (𝑘 ∈ 𝐵 → if(𝑘 ∈ 𝐵, 𝐶, 0) = 𝐶) | |
49 | 48 | adantl 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → if(𝑘 ∈ 𝐵, 𝐶, 0) = 𝐶) |
50 | 47, 49 | oveq12d 7168 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = (0 + 𝐶)) |
51 | 15 | addid2d 10835 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (0 + 𝐶) = 𝐶) |
52 | 50, 51 | eqtrd 2856 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = 𝐶) |
53 | 44, 52 | jaodan 954 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ 𝐵)) → (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = 𝐶) |
54 | 29, 53 | syldan 593 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = 𝐶) |
55 | 54 | sumeq2dv 15054 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 (if(𝑘 ∈ 𝐴, 𝐶, 0) + if(𝑘 ∈ 𝐵, 𝐶, 0)) = Σ𝑘 ∈ 𝑈 𝐶) |
56 | 19, 25, 55 | 3eqtr2rd 2863 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑈 𝐶 = (Σ𝑘 ∈ 𝐴 𝐶 + Σ𝑘 ∈ 𝐵 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∨ wo 843 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ∪ cun 3934 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 ifcif 4467 ‘cfv 6350 (class class class)co 7150 Fincfn 8503 ℂcc 10529 0cc0 10531 + caddc 10534 ℤ≥cuz 12237 Σcsu 15036 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-inf2 9098 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-se 5510 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-isom 6359 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-sup 8900 df-oi 8968 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-fz 12887 df-fzo 13028 df-seq 13364 df-exp 13424 df-hash 13685 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-clim 14839 df-sum 15037 |
This theorem is referenced by: fsumsplitf 15092 sumpr 15097 sumtp 15098 fsumm1 15100 fsum1p 15102 fsumsplitsnun 15104 fsum2dlem 15119 fsumless 15145 fsumabs 15150 fsumrlim 15160 fsumo1 15161 o1fsum 15162 cvgcmpce 15167 fsumiun 15170 incexclem 15185 incexc 15186 isumltss 15197 climcndslem1 15198 climcndslem2 15199 mertenslem1 15234 bitsinv1 15785 bitsinvp1 15792 sylow2a 18738 fsumcn 23472 ovolfiniun 24096 volfiniun 24142 uniioombllem3 24180 itgfsum 24421 dvmptfsum 24566 vieta1lem2 24894 mtest 24986 birthdaylem2 25524 fsumharmonic 25583 ftalem5 25648 chtprm 25724 chtdif 25729 perfectlem2 25800 lgsquadlem2 25951 dchrisumlem1 26059 dchrisumlem2 26060 rpvmasum2 26082 dchrisum0lem1b 26085 dchrisum0lem3 26089 pntrsumbnd2 26137 pntrlog2bndlem6 26153 pntpbnd2 26157 pntlemf 26175 axlowdimlem16 26737 axlowdimlem17 26738 vtxdgoddnumeven 27329 indsumin 31276 signsplypnf 31815 fsum2dsub 31873 hgt750lemd 31914 tgoldbachgtde 31926 jm2.22 39585 jm2.23 39586 sumpair 41285 sumnnodd 41903 stoweidlem11 42289 stoweidlem26 42304 stoweidlem44 42322 sge0resplit 42681 sge0split 42684 fsumsplitsndif 43526 perfectALTVlem2 43880 |
Copyright terms: Public domain | W3C validator |