![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > subglsm | Structured version Visualization version GIF version |
Description: The subgroup sum evaluated within a subgroup. (Contributed by Mario Carneiro, 27-Apr-2016.) |
Ref | Expression |
---|---|
subglsm.h | ⊢ 𝐻 = (𝐺 ↾s 𝑆) |
subglsm.s | ⊢ ⊕ = (LSSum‘𝐺) |
subglsm.a | ⊢ 𝐴 = (LSSum‘𝐻) |
Ref | Expression |
---|---|
subglsm | ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → (𝑇 ⊕ 𝑈) = (𝑇𝐴𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp11 1200 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) ∧ 𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈) → 𝑆 ∈ (SubGrp‘𝐺)) | |
2 | subglsm.h | . . . . . . 7 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
3 | eqid 2798 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
4 | 2, 3 | ressplusg 16604 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻)) |
5 | 1, 4 | syl 17 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) ∧ 𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈) → (+g‘𝐺) = (+g‘𝐻)) |
6 | 5 | oveqd 7152 | . . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) ∧ 𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈) → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝐻)𝑦)) |
7 | 6 | mpoeq3dva 7210 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) = (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐻)𝑦))) |
8 | 7 | rneqd 5772 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐻)𝑦))) |
9 | subgrcl 18276 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
10 | 9 | 3ad2ant1 1130 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝐺 ∈ Grp) |
11 | simp2 1134 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑇 ⊆ 𝑆) | |
12 | eqid 2798 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
13 | 12 | subgss 18272 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
14 | 13 | 3ad2ant1 1130 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑆 ⊆ (Base‘𝐺)) |
15 | 11, 14 | sstrd 3925 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑇 ⊆ (Base‘𝐺)) |
16 | simp3 1135 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑈 ⊆ 𝑆) | |
17 | 16, 14 | sstrd 3925 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑈 ⊆ (Base‘𝐺)) |
18 | subglsm.s | . . . 4 ⊢ ⊕ = (LSSum‘𝐺) | |
19 | 12, 3, 18 | lsmvalx 18756 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑇 ⊕ 𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦))) |
20 | 10, 15, 17, 19 | syl3anc 1368 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → (𝑇 ⊕ 𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦))) |
21 | 2 | subggrp 18274 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp) |
22 | 21 | 3ad2ant1 1130 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝐻 ∈ Grp) |
23 | 2 | subgbas 18275 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻)) |
24 | 23 | 3ad2ant1 1130 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑆 = (Base‘𝐻)) |
25 | 11, 24 | sseqtrd 3955 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑇 ⊆ (Base‘𝐻)) |
26 | 16, 24 | sseqtrd 3955 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → 𝑈 ⊆ (Base‘𝐻)) |
27 | eqid 2798 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
28 | eqid 2798 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
29 | subglsm.a | . . . 4 ⊢ 𝐴 = (LSSum‘𝐻) | |
30 | 27, 28, 29 | lsmvalx 18756 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐻) ∧ 𝑈 ⊆ (Base‘𝐻)) → (𝑇𝐴𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐻)𝑦))) |
31 | 22, 25, 26, 30 | syl3anc 1368 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → (𝑇𝐴𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐻)𝑦))) |
32 | 8, 20, 31 | 3eqtr4d 2843 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑆 ∧ 𝑈 ⊆ 𝑆) → (𝑇 ⊕ 𝑈) = (𝑇𝐴𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ⊆ wss 3881 ran crn 5520 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 Basecbs 16475 ↾s cress 16476 +gcplusg 16557 Grpcgrp 18095 SubGrpcsubg 18265 LSSumclsm 18751 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-subg 18268 df-lsm 18753 |
This theorem is referenced by: pgpfaclem1 19196 |
Copyright terms: Public domain | W3C validator |