Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gsumunsnf | Structured version Visualization version GIF version |
Description: Append an element to a finite group sum, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by Thierry Arnoux, 28-Mar-2018.) (Proof shortened by AV, 11-Dec-2019.) |
Ref | Expression |
---|---|
gsumunsnf.0 | ⊢ Ⅎ𝑘𝑌 |
gsumunsnf.b | ⊢ 𝐵 = (Base‘𝐺) |
gsumunsnf.p | ⊢ + = (+g‘𝐺) |
gsumunsnf.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
gsumunsnf.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
gsumunsnf.f | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝐵) |
gsumunsnf.m | ⊢ (𝜑 → 𝑀 ∈ 𝑉) |
gsumunsnf.d | ⊢ (𝜑 → ¬ 𝑀 ∈ 𝐴) |
gsumunsnf.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
gsumunsnf.s | ⊢ (𝑘 = 𝑀 → 𝑋 = 𝑌) |
Ref | Expression |
---|---|
gsumunsnf | ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ (𝐴 ∪ {𝑀}) ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsumunsnf.b | . 2 ⊢ 𝐵 = (Base‘𝐺) | |
2 | gsumunsnf.p | . 2 ⊢ + = (+g‘𝐺) | |
3 | gsumunsnf.g | . 2 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
4 | gsumunsnf.a | . 2 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
5 | gsumunsnf.f | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
6 | gsumunsnf.m | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
7 | gsumunsnf.d | . 2 ⊢ (𝜑 → ¬ 𝑀 ∈ 𝐴) | |
8 | gsumunsnf.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
9 | gsumunsnf.s | . . 3 ⊢ (𝑘 = 𝑀 → 𝑋 = 𝑌) | |
10 | 9 | adantl 484 | . 2 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝑋 = 𝑌) |
11 | gsumunsnf.0 | . 2 ⊢ Ⅎ𝑘𝑌 | |
12 | 1, 2, 3, 4, 5, 6, 7, 8, 10, 11 | gsumunsnfd 19071 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ (𝐴 ∪ {𝑀}) ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Ⅎwnfc 2961 ∪ cun 3933 {csn 4560 ↦ cmpt 5138 ‘cfv 6349 (class class class)co 7150 Fincfn 8503 Basecbs 16477 +gcplusg 16559 Σg cgsu 16708 CMndccmn 18900 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-iin 4914 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-se 5509 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-of 7403 df-om 7575 df-1st 7683 df-2nd 7684 df-supp 7825 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-fsupp 8828 df-oi 8968 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-fzo 13028 df-seq 13364 df-hash 13685 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-plusg 16572 df-0g 16709 df-gsum 16710 df-mre 16851 df-mrc 16852 df-acs 16854 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-submnd 17951 df-mulg 18219 df-cntz 18441 df-cmn 18902 |
This theorem is referenced by: gsumvsca1 30849 gsumvsca2 30850 |
Copyright terms: Public domain | W3C validator |