| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indsum | Structured version Visualization version GIF version | ||
| Description: Finite sum of a product with the indicator function / Cartesian product with the indicator function. Note: this theorem cannot be efficiently shortened using sumss2 15765, unless there are some additional auxiliary theorems like (if(𝑥 ∈ 𝐴, 1, 0) · 𝐵) = if(𝑥 ∈ 𝐴, 𝐵, 0). (Contributed by Thierry Arnoux, 14-Aug-2017.) (Proof shortened by AV, 11-Apr-2026.) |
| Ref | Expression |
|---|---|
| indsum.1 | ⊢ (𝜑 → 𝑂 ∈ Fin) |
| indsum.2 | ⊢ (𝜑 → 𝐴 ⊆ 𝑂) |
| indsum.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → 𝐵 ∈ ℂ) |
| Ref | Expression |
|---|---|
| indsum | ⊢ (𝜑 → Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indsum.2 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝑂) | |
| 2 | 1 | sselda 3939 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑂) |
| 3 | indsum.1 | . . . . . . . 8 ⊢ (𝜑 → 𝑂 ∈ Fin) | |
| 4 | 3, 1 | jca 520 | . . . . . . 7 ⊢ (𝜑 → (𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂)) |
| 5 | fvindre 12214 | . . . . . . 7 ⊢ (((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂) ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) | |
| 6 | 4, 5 | sylan 591 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) |
| 7 | 6 | recnd 11225 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℂ) |
| 8 | indsum.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → 𝐵 ∈ ℂ) | |
| 9 | 7, 8 | mulcld 11217 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 10 | 2, 9 | syldan 602 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 11 | 3 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑂 ∈ Fin) |
| 12 | 1 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝐴 ⊆ 𝑂) |
| 13 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ (𝑂 ∖ 𝐴)) | |
| 14 | ind0 12216 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) | |
| 15 | 11, 12, 13, 14 | syl3anc 1394 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) |
| 16 | 15 | oveq1d 7415 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (0 · 𝐵)) |
| 17 | difssd 4093 | . . . . . 6 ⊢ (𝜑 → (𝑂 ∖ 𝐴) ⊆ 𝑂) | |
| 18 | 17 | sselda 3939 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ 𝑂) |
| 19 | 8 | mul02d 11396 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (0 · 𝐵) = 0) |
| 20 | 18, 19 | syldan 602 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (0 · 𝐵) = 0) |
| 21 | 16, 20 | eqtrd 2800 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 0) |
| 22 | 1, 10, 21, 3 | fsumss 15764 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵)) |
| 23 | 3 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑂 ∈ Fin) |
| 24 | 1 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ 𝑂) |
| 25 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 26 | ind1 12215 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) | |
| 27 | 23, 24, 25, 26 | syl3anc 1394 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) |
| 28 | 27 | oveq1d 7415 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (1 · 𝐵)) |
| 29 | 8 | mullidd 11215 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (1 · 𝐵) = 𝐵) |
| 30 | 2, 29 | syldan 602 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · 𝐵) = 𝐵) |
| 31 | 28, 30 | eqtrd 2800 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 𝐵) |
| 32 | 31 | sumeq2dv 15741 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| 33 | 22, 32 | eqtr3d 2802 | 1 ⊢ (𝜑 → Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∖ cdif 3904 ⊆ wss 3907 ‘cfv 6525 (class class class)co 7400 Fincfn 8931 ℂcc 11086 ℝcr 11087 0cc0 11088 1c1 11089 · cmul 11093 𝟭cind 12206 Σcsu 15725 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-inf2 9598 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-ind 12207 df-nn 12222 df-2 12291 df-3 12292 df-n0 12493 df-z 12580 df-uz 12851 df-rp 13005 df-fz 13524 df-fzo 13671 df-seq 14026 df-exp 14086 df-hash 14355 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-clim 15527 df-sum 15726 |
| This theorem is referenced by: indsumhash 15869 |
| Copyright terms: Public domain | W3C validator |