| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmelvali | Structured version Visualization version GIF version | ||
| Description: Subgroup sum membership (for a left module or left vector space). (Contributed by NM, 4-Feb-2014.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmelval.a | ⊢ + = (+g‘𝐺) |
| lsmelval.p | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmelvali | ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝑈)) → (𝑋 + 𝑌) ∈ (𝑇 ⊕ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subgrcl 19391 | . . . 4 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝐺 ∈ Grp) |
| 3 | eqid 2763 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 4 | 3 | subgss 19387 | . . . 4 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺)) |
| 5 | 4 | adantr 486 | . . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑇 ⊆ (Base‘𝐺)) |
| 6 | 3 | subgss 19387 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 7 | 6 | adantl 487 | . . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑈 ⊆ (Base‘𝐺)) |
| 8 | 2, 5, 7 | 3jca 1146 | . 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺))) |
| 9 | lsmelval.a | . . 3 ⊢ + = (+g‘𝐺) | |
| 10 | lsmelval.p | . . 3 ⊢ ⊕ = (LSSum‘𝐺) | |
| 11 | 3, 9, 10 | lsmelvalix 19906 | . 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝑈)) → (𝑋 + 𝑌) ∈ (𝑇 ⊕ 𝑈)) |
| 12 | 8, 11 | sylan 592 | 1 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝑈)) → (𝑋 + 𝑌) ∈ (𝑇 ⊕ 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 Grpcgrp 19194 SubGrpcsubg 19380 LSSumclsm 19899 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-subg 19383 df-lsm 19901 |
| This theorem is used by: lsmsubg 19919 lsmmod 19940 lsmdisj2 19947 lsmhash 19970 ablfacrp 20333 lsmcl 21409 lsmelval2 21411 lsppreli 21416 lspprabs 21421 lspabs3 21450 pjthlem2 25814 lkrlsp 40425 dia2dimlem5 42391 mapdindp0 43042 hdmaprnlem3eN 43181 |
| Copyright terms: Public domain | W3C validator |