| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmless12 | Structured version Visualization version GIF version | ||
| Description: Subset implies subgroup sum subset. (Contributed by NM, 14-Jan-2015.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmub1.p | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmless12 | ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → (𝑅 ⊕ 𝑇) ⊆ (𝑆 ⊕ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subgrcl 19254 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 2 | 1 | ad2antrr 739 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝐺 ∈ Grp) |
| 3 | eqid 2760 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 4 | 3 | subgss 19250 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 5 | 4 | ad2antrr 739 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑆 ⊆ (Base‘𝐺)) |
| 6 | simprr 785 | . . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑇 ⊆ 𝑈) | |
| 7 | 3 | subgss 19250 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 8 | 7 | ad2antlr 740 | . . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑈 ⊆ (Base‘𝐺)) |
| 9 | 6, 8 | sstrd 3941 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑇 ⊆ (Base‘𝐺)) |
| 10 | simprl 783 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑅 ⊆ 𝑆) | |
| 11 | lsmub1.p | . . . 4 ⊢ ⊕ = (LSSum‘𝐺) | |
| 12 | 3, 11 | lsmless1x 19771 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑆 ⊆ (Base‘𝐺) ∧ 𝑇 ⊆ (Base‘𝐺)) ∧ 𝑅 ⊆ 𝑆) → (𝑅 ⊕ 𝑇) ⊆ (𝑆 ⊕ 𝑇)) |
| 13 | 2, 5, 9, 10, 12 | syl31anc 1400 | . 2 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → (𝑅 ⊕ 𝑇) ⊆ (𝑆 ⊕ 𝑇)) |
| 14 | simpll 779 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 15 | simplr 781 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 16 | 11 | lsmless2 19788 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ (𝑆 ⊕ 𝑈)) |
| 17 | 14, 15, 6, 16 | syl3anc 1398 | . 2 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → (𝑆 ⊕ 𝑇) ⊆ (𝑆 ⊕ 𝑈)) |
| 18 | 13, 17 | sstrd 3941 | 1 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑅 ⊆ 𝑆 ∧ 𝑇 ⊆ 𝑈)) → (𝑅 ⊕ 𝑇) ⊆ (𝑆 ⊕ 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 Grpcgrp 19057 SubGrpcsubg 19243 LSSumclsm 19761 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 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-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-subg 19246 df-lsm 19763 |
| This theorem is used by: lsmlub 19791 dochexmidlem2 42334 |
| Copyright terms: Public domain | W3C validator |