| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsummptun | Structured version Visualization version GIF version | ||
| Description: Group sum of a disjoint union, whereas sums are expressed as mappings. (Contributed by Thierry Arnoux, 28-Mar-2018.) (Proof shortened by AV, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| gsummptun.b | ⊢ 𝐵 = (Base‘𝑊) |
| gsummptun.p | ⊢ + = (+g‘𝑊) |
| gsummptun.w | ⊢ (𝜑 → 𝑊 ∈ CMnd) |
| gsummptun.a | ⊢ (𝜑 → (𝐴 ∪ 𝐶) ∈ Fin) |
| gsummptun.d | ⊢ (𝜑 → (𝐴 ∩ 𝐶) = ∅) |
| gsummptun.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ 𝐶)) → 𝐷 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| gsummptun | ⊢ (𝜑 → (𝑊 Σg (𝑥 ∈ (𝐴 ∪ 𝐶) ↦ 𝐷)) = ((𝑊 Σg (𝑥 ∈ 𝐴 ↦ 𝐷)) + (𝑊 Σg (𝑥 ∈ 𝐶 ↦ 𝐷)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsummptun.b | . 2 ⊢ 𝐵 = (Base‘𝑊) | |
| 2 | gsummptun.p | . 2 ⊢ + = (+g‘𝑊) | |
| 3 | gsummptun.w | . 2 ⊢ (𝜑 → 𝑊 ∈ CMnd) | |
| 4 | gsummptun.a | . 2 ⊢ (𝜑 → (𝐴 ∪ 𝐶) ∈ Fin) | |
| 5 | gsummptun.1 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ 𝐶)) → 𝐷 ∈ 𝐵) | |
| 6 | gsummptun.d | . 2 ⊢ (𝜑 → (𝐴 ∩ 𝐶) = ∅) | |
| 7 | eqidd 2738 | . 2 ⊢ (𝜑 → (𝐴 ∪ 𝐶) = (𝐴 ∪ 𝐶)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | gsummptfidmsplit 19896 | 1 ⊢ (𝜑 → (𝑊 Σg (𝑥 ∈ (𝐴 ∪ 𝐶) ↦ 𝐷)) = ((𝑊 Σg (𝑥 ∈ 𝐴 ↦ 𝐷)) + (𝑊 Σg (𝑥 ∈ 𝐶 ↦ 𝐷)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∪ cun 3888 ∩ cin 3889 ∅c0 4274 ↦ cmpt 5167 ‘cfv 6492 (class class class)co 7360 Fincfn 8886 Basecbs 17170 +gcplusg 17211 Σg cgsu 17394 CMndccmn 19746 |
| 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 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8104 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 df-oi 9418 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-seq 13955 df-hash 14284 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-0g 17395 df-gsum 17396 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-cntz 19283 df-cmn 19748 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |