| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumdifsnd | Structured version Visualization version GIF version | ||
| Description: Extract a summand from a finitely supported group sum. (Contributed by AV, 21-Apr-2019.) (Revised by AV, 28-Jul-2019.) |
| Ref | Expression |
|---|---|
| gsumdifsnd.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsumdifsnd.p | ⊢ + = (+g‘𝐺) |
| gsumdifsnd.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
| gsumdifsnd.a | ⊢ (𝜑 → 𝐴 ∈ 𝑊) |
| gsumdifsnd.f | ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑋) finSupp (0g‘𝐺)) |
| gsumdifsnd.e | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝐵) |
| gsumdifsnd.m | ⊢ (𝜑 → 𝑀 ∈ 𝐴) |
| gsumdifsnd.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| gsumdifsnd.s | ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝑋 = 𝑌) |
| Ref | Expression |
|---|---|
| gsumdifsnd | ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ (𝐴 ∖ {𝑀}) ↦ 𝑋)) + 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumdifsnd.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2769 | . . 3 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 3 | gsumdifsnd.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 4 | gsumdifsnd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 5 | gsumdifsnd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑊) | |
| 6 | gsumdifsnd.e | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
| 7 | gsumdifsnd.f | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑋) finSupp (0g‘𝐺)) | |
| 8 | gsumdifsnd.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝐴) | |
| 9 | 8 | snssd 4754 | . . . . 5 ⊢ (𝜑 → {𝑀} ⊆ 𝐴) |
| 10 | difin2 4262 | . . . . 5 ⊢ ({𝑀} ⊆ 𝐴 → ({𝑀} ∖ {𝑀}) = ((𝐴 ∖ {𝑀}) ∩ {𝑀})) | |
| 11 | 9, 10 | syl 18 | . . . 4 ⊢ (𝜑 → ({𝑀} ∖ {𝑀}) = ((𝐴 ∖ {𝑀}) ∩ {𝑀})) |
| 12 | difid 4338 | . . . 4 ⊢ ({𝑀} ∖ {𝑀}) = ∅ | |
| 13 | 11, 12 | eqtr3di 2819 | . . 3 ⊢ (𝜑 → ((𝐴 ∖ {𝑀}) ∩ {𝑀}) = ∅) |
| 14 | difsnid 4777 | . . . . 5 ⊢ (𝑀 ∈ 𝐴 → ((𝐴 ∖ {𝑀}) ∪ {𝑀}) = 𝐴) | |
| 15 | 8, 14 | syl 18 | . . . 4 ⊢ (𝜑 → ((𝐴 ∖ {𝑀}) ∪ {𝑀}) = 𝐴) |
| 16 | 15 | eqcomd 2775 | . . 3 ⊢ (𝜑 → 𝐴 = ((𝐴 ∖ {𝑀}) ∪ {𝑀})) |
| 17 | 1, 2, 3, 4, 5, 6, 7, 13, 16 | gsumsplit2 19995 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ (𝐴 ∖ {𝑀}) ↦ 𝑋)) + (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝑋)))) |
| 18 | cmnmnd 19863 | . . . . 5 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd) | |
| 19 | 4, 18 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 20 | gsumdifsnd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 21 | gsumdifsnd.s | . . . 4 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝑋 = 𝑌) | |
| 22 | 1, 19, 8, 20, 21 | gsumsnd 20018 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝑋)) = 𝑌) |
| 23 | 22 | oveq2d 7424 | . 2 ⊢ (𝜑 → ((𝐺 Σg (𝑘 ∈ (𝐴 ∖ {𝑀}) ↦ 𝑋)) + (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝑋))) = ((𝐺 Σg (𝑘 ∈ (𝐴 ∖ {𝑀}) ↦ 𝑋)) + 𝑌)) |
| 24 | 17, 23 | eqtrd 2804 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ (𝐴 ∖ {𝑀}) ↦ 𝑋)) + 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∖ cdif 3910 ∪ cun 3911 ∩ cin 3912 ⊆ wss 3913 ∅c0 4294 {csn 4591 class class class wbr 5110 ↦ cmpt 5193 ‘cfv 6533 (class class class)co 7408 finSupp cfsupp 9317 Basecbs 17265 +gcplusg 17306 0gc0g 17488 Σg cgsu 17489 Mndcmnd 18788 CMndccmn 19846 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-of 7672 df-om 7859 df-1st 7982 df-2nd 7983 df-supp 8153 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9318 df-oi 9468 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-2 12299 df-n0 12501 df-z 12588 df-uz 12859 df-fz 13532 df-fzo 13679 df-seq 14034 df-hash 14363 df-sets 17220 df-slot 17238 df-ndx 17250 df-base 17266 df-ress 17287 df-plusg 17319 df-0g 17490 df-gsum 17491 df-mre 17634 df-mrc 17635 df-acs 17637 df-mgm 18694 df-sgrp 18773 df-mnd 18789 df-submnd 18838 df-mulg 19130 df-cntz 19383 df-cmn 19848 |
| This theorem is referenced by: dmatmul 22619 matunitlindflem1 38150 lincdifsn 49082 |
| Copyright terms: Public domain | W3C validator |