| 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 15812, 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 3931 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑂) |
| 3 | indsum.1 | . . . . . . . 8 ⊢ (𝜑 → 𝑂 ∈ Fin) | |
| 4 | 3, 1 | jca 521 | . . . . . . 7 ⊢ (𝜑 → (𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂)) |
| 5 | fvindre 12250 | . . . . . . 7 ⊢ (((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂) ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) | |
| 6 | 4, 5 | sylan 592 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) |
| 7 | 6 | recnd 11261 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℂ) |
| 8 | indsum.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → 𝐵 ∈ ℂ) | |
| 9 | 7, 8 | mulcld 11253 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 10 | 2, 9 | syldan 603 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 11 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑂 ∈ Fin) |
| 12 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝐴 ⊆ 𝑂) |
| 13 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ (𝑂 ∖ 𝐴)) | |
| 14 | ind0 12252 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) | |
| 15 | 11, 12, 13, 14 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) |
| 16 | 15 | oveq1d 7428 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (0 · 𝐵)) |
| 17 | difssd 4084 | . . . . . 6 ⊢ (𝜑 → (𝑂 ∖ 𝐴) ⊆ 𝑂) | |
| 18 | 17 | sselda 3931 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ 𝑂) |
| 19 | 8 | mul02d 11432 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (0 · 𝐵) = 0) |
| 20 | 18, 19 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (0 · 𝐵) = 0) |
| 21 | 16, 20 | eqtrd 2795 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 0) |
| 22 | 1, 10, 21, 3 | fsumss 15811 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵)) |
| 23 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑂 ∈ Fin) |
| 24 | 1 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ 𝑂) |
| 25 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 26 | ind1 12251 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) | |
| 27 | 23, 24, 25, 26 | syl3anc 1398 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) |
| 28 | 27 | oveq1d 7428 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (1 · 𝐵)) |
| 29 | 8 | mullidd 11251 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (1 · 𝐵) = 𝐵) |
| 30 | 2, 29 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · 𝐵) = 𝐵) |
| 31 | 28, 30 | eqtrd 2795 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 𝐵) |
| 32 | 31 | sumeq2dv 15789 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| 33 | 22, 32 | eqtr3d 2797 | 1 ⊢ (𝜑 → Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∖ cdif 3896 ⊆ wss 3899 ‘cfv 6533 (class class class)co 7413 Fincfn 8952 ℂcc 11122 ℝcr 11123 0cc0 11124 1c1 11125 · cmul 11129 𝟭cind 12242 Σcsu 15773 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-oi 9482 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-ind 12243 df-nn 12258 df-2 12327 df-3 12328 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-fz 13562 df-fzo 13710 df-seq 14066 df-exp 14126 df-hash 14395 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-clim 15575 df-sum 15774 |
| This theorem is used by: indsumhash 15916 |
| Copyright terms: Public domain | W3C validator |