| 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 15688, 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 3921 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑂) |
| 3 | indsum.1 | . . . . . . . 8 ⊢ (𝜑 → 𝑂 ∈ Fin) | |
| 4 | 3, 1 | jca 511 | . . . . . . 7 ⊢ (𝜑 → (𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂)) |
| 5 | fvindre 12167 | . . . . . . 7 ⊢ (((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂) ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) | |
| 6 | 4, 5 | sylan 581 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℝ) |
| 7 | 6 | recnd 11173 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑥) ∈ ℂ) |
| 8 | indsum.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → 𝐵 ∈ ℂ) | |
| 9 | 7, 8 | mulcld 11165 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 10 | 2, 9 | syldan 592 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) ∈ ℂ) |
| 11 | 3 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑂 ∈ Fin) |
| 12 | 1 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝐴 ⊆ 𝑂) |
| 13 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ (𝑂 ∖ 𝐴)) | |
| 14 | ind0 12169 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) | |
| 15 | 11, 12, 13, 14 | syl3anc 1374 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 0) |
| 16 | 15 | oveq1d 7382 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (0 · 𝐵)) |
| 17 | difssd 4077 | . . . . . 6 ⊢ (𝜑 → (𝑂 ∖ 𝐴) ⊆ 𝑂) | |
| 18 | 17 | sselda 3921 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → 𝑥 ∈ 𝑂) |
| 19 | 8 | mul02d 11344 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (0 · 𝐵) = 0) |
| 20 | 18, 19 | syldan 592 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → (0 · 𝐵) = 0) |
| 21 | 16, 20 | eqtrd 2771 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑂 ∖ 𝐴)) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 0) |
| 22 | 1, 10, 21, 3 | fsumss 15687 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵)) |
| 23 | 3 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑂 ∈ Fin) |
| 24 | 1 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ 𝑂) |
| 25 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 26 | ind1 12168 | . . . . . 6 ⊢ ((𝑂 ∈ Fin ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) | |
| 27 | 23, 24, 25, 26 | syl3anc 1374 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) |
| 28 | 27 | oveq1d 7382 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = (1 · 𝐵)) |
| 29 | 8 | mullidd 11163 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (1 · 𝐵) = 𝐵) |
| 30 | 2, 29 | syldan 592 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (1 · 𝐵) = 𝐵) |
| 31 | 28, 30 | eqtrd 2771 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = 𝐵) |
| 32 | 31 | sumeq2dv 15664 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝐴 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| 33 | 22, 32 | eqtr3d 2773 | 1 ⊢ (𝜑 → Σ𝑥 ∈ 𝑂 ((((𝟭‘𝑂)‘𝐴)‘𝑥) · 𝐵) = Σ𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3886 ⊆ wss 3889 ‘cfv 6498 (class class class)co 7367 Fincfn 8893 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 · cmul 11043 𝟭cind 12159 Σcsu 15648 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-oi 9425 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-ind 12160 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fz 13462 df-fzo 13609 df-seq 13964 df-exp 14024 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-clim 15450 df-sum 15649 |
| This theorem is referenced by: indsumhash 15792 |
| Copyright terms: Public domain | W3C validator |