Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gsumunsnfd | 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 AV, 11-Dec-2019.) |
Ref | Expression |
---|---|
gsumunsnd.b | ⊢ 𝐵 = (Base‘𝐺) |
gsumunsnd.p | ⊢ + = (+g‘𝐺) |
gsumunsnd.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
gsumunsnd.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
gsumunsnd.f | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝐵) |
gsumunsnd.m | ⊢ (𝜑 → 𝑀 ∈ 𝑉) |
gsumunsnd.d | ⊢ (𝜑 → ¬ 𝑀 ∈ 𝐴) |
gsumunsnd.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
gsumunsnd.s | ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝑋 = 𝑌) |
gsumunsnfd.0 | ⊢ Ⅎ𝑘𝑌 |
Ref | Expression |
---|---|
gsumunsnfd | ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ (𝐴 ∪ {𝑀}) ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsumunsnd.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | gsumunsnd.p | . . 3 ⊢ + = (+g‘𝐺) | |
3 | gsumunsnd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
4 | gsumunsnd.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
5 | snfi 8710 | . . . 4 ⊢ {𝑀} ∈ Fin | |
6 | unfi 8839 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ {𝑀} ∈ Fin) → (𝐴 ∪ {𝑀}) ∈ Fin) | |
7 | 4, 5, 6 | sylancl 589 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝑀}) ∈ Fin) |
8 | elun 4053 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∪ {𝑀}) ↔ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝑀})) | |
9 | gsumunsnd.f | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
10 | elsni 4548 | . . . . . . 7 ⊢ (𝑘 ∈ {𝑀} → 𝑘 = 𝑀) | |
11 | gsumunsnd.s | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝑋 = 𝑌) | |
12 | 10, 11 | sylan2 596 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝑋 = 𝑌) |
13 | gsumunsnd.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
14 | 13 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝑌 ∈ 𝐵) |
15 | 12, 14 | eqeltrd 2834 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑀}) → 𝑋 ∈ 𝐵) |
16 | 9, 15 | jaodan 958 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∨ 𝑘 ∈ {𝑀})) → 𝑋 ∈ 𝐵) |
17 | 8, 16 | sylan2b 597 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∪ {𝑀})) → 𝑋 ∈ 𝐵) |
18 | gsumunsnd.d | . . . 4 ⊢ (𝜑 → ¬ 𝑀 ∈ 𝐴) | |
19 | disjsn 4617 | . . . 4 ⊢ ((𝐴 ∩ {𝑀}) = ∅ ↔ ¬ 𝑀 ∈ 𝐴) | |
20 | 18, 19 | sylibr 237 | . . 3 ⊢ (𝜑 → (𝐴 ∩ {𝑀}) = ∅) |
21 | eqidd 2735 | . . 3 ⊢ (𝜑 → (𝐴 ∪ {𝑀}) = (𝐴 ∪ {𝑀})) | |
22 | 1, 2, 3, 7, 17, 20, 21 | gsummptfidmsplit 19287 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ (𝐴 ∪ {𝑀}) ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝑋)))) |
23 | cmnmnd 19158 | . . . . 5 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd) | |
24 | 3, 23 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
25 | gsumunsnd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
26 | nfv 1922 | . . . 4 ⊢ Ⅎ𝑘𝜑 | |
27 | gsumunsnfd.0 | . . . 4 ⊢ Ⅎ𝑘𝑌 | |
28 | 1, 24, 25, 13, 11, 26, 27 | gsumsnfd 19308 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝑋)) = 𝑌) |
29 | 28 | oveq2d 7218 | . 2 ⊢ (𝜑 → ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + (𝐺 Σg (𝑘 ∈ {𝑀} ↦ 𝑋))) = ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + 𝑌)) |
30 | 22, 29 | eqtrd 2774 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ (𝐴 ∪ {𝑀}) ↦ 𝑋)) = ((𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) + 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∨ wo 847 = wceq 1543 ∈ wcel 2110 Ⅎwnfc 2880 ∪ cun 3855 ∩ cin 3856 ∅c0 4227 {csn 4531 ↦ cmpt 5124 ‘cfv 6369 (class class class)co 7202 Fincfn 8615 Basecbs 16684 +gcplusg 16767 Σg cgsu 16917 Mndcmnd 18145 CMndccmn 19142 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-int 4850 df-iun 4896 df-iin 4897 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-se 5499 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-isom 6378 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-of 7458 df-om 7634 df-1st 7750 df-2nd 7751 df-supp 7893 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-er 8380 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-fsupp 8975 df-oi 9115 df-card 9538 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-nn 11814 df-2 11876 df-n0 12074 df-z 12160 df-uz 12422 df-fz 13079 df-fzo 13222 df-seq 13558 df-hash 13880 df-ndx 16687 df-slot 16688 df-base 16690 df-sets 16691 df-ress 16692 df-plusg 16780 df-0g 16918 df-gsum 16919 df-mre 17061 df-mrc 17062 df-acs 17064 df-mgm 18086 df-sgrp 18135 df-mnd 18146 df-submnd 18191 df-mulg 18461 df-cntz 18683 df-cmn 19144 |
This theorem is referenced by: gsumunsnd 19315 gsumunsnf 19316 |
Copyright terms: Public domain | W3C validator |