| 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 15898, 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 3908 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑂) |
| 3 | indsum.1 | . . . . . . . 8 ⊢ (𝜑 → 𝑂 ∈ Fin) | |
| 4 | 3, 1 | jca 521 | . . . . . . 7 ⊢ (𝜑 → (𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂)) |
| 5 | fvindre 12332 | . . . . . . 7 ⊢ (((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂) ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) | |
| 6 | 4, 5 | sylan 592 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) |
| 7 | 6 | recnd 11341 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℂ) |
| 8 | indsum.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → 𝐵 ∈ ℂ) | |
| 9 | 7, 8 | mulcld 11333 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 10 | 2, 9 | syldan 603 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 11 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑂 ∈ Fin) |
| 12 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝐴 ⊆ 𝑂) |
| 13 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ (𝑂 ∖ 𝐴)) | |
| 14 | ind0 12334 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) | |
| 15 | 11, 12, 13, 14 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) |
| 16 | 15 | oveq1d 7436 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (0 · 𝐵)) |
| 17 | difssd 4073 | . . . . . 6 ⊢ (𝜑 → (𝑂 ∖ 𝐴) ⊆ 𝑂) | |
| 18 | 17 | sselda 3908 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ 𝑂) |
| 19 | 8 | mul02d 11512 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (0 · 𝐵) = 0) |
| 20 | 18, 19 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (0 · 𝐵) = 0) |
| 21 | 16, 20 | eqtrd 2795 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 0) |
| 22 | 1, 10, 21, 3 | fsumss 15897 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵)) |
| 23 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑂 ∈ Fin) |
| 24 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ 𝑂) |
| 25 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 26 | ind1 12333 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) | |
| 27 | 23, 24, 25, 26 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) |
| 28 | 27 | oveq1d 7436 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (1 · 𝐵)) |
| 29 | 8 | mullidd 11331 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (1 · 𝐵) = 𝐵) |
| 30 | 2, 29 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · 𝐵) = 𝐵) |
| 31 | 28, 30 | eqtrd 2795 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 𝐵) |
| 32 | 31 | sumeq2dv 15875 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| 33 | 22, 32 | eqtr3d 2797 | 1 ⊢ (𝜑 → Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ∖ cdif 4045 ‘cfv 6539 (class class class)co 7421 Fincfn 8977 ℂcc 11202 ℝcr 11203 0cc0 11204 1c1 11205 · cmul 11209 𝟭cind 12324 Σcsu 15859 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-inf2 9646 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 ax-pre-sup 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-isom 6548 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-sup 9438 df-oi 9508 df-card 10024 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-div 11978 df-ind 12325 df-nn 12340 df-2 12409 df-3 12410 df-n0 12611 df-z 12698 df-uz 12970 df-rp 13125 df-fz 13644 df-fzo 13793 df-seq 14149 df-exp 14209 df-hash 14479 df-cj 15272 df-re 15273 df-im 15274 df-sqrt 15408 df-abs 15409 df-clim 15661 df-sum 15860 |
| This theorem is used by: indsumhash 16002 |
| Copyright terms: Public domain | W3C validator |