| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmssv | Structured version Visualization version GIF version | ||
| Description: Subgroup sum is a subset of the base. (Contributed by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmless2.v | ⊢ 𝐵 = (Base‘𝐺) |
| lsmless2.s | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmssv | ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) ⊆ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsmless2.v | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2763 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | lsmless2.s | . . 3 ⊢ ⊕ = (LSSum‘𝐺) | |
| 4 | 1, 2, 3 | lsmvalx 19704 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦))) |
| 5 | simpl1 1210 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝐺 ∈ Mnd) | |
| 6 | simp2 1155 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → 𝑇 ⊆ 𝐵) | |
| 7 | 6 | sselda 3937 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝐵) |
| 8 | 7 | adantrr 729 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝐵) |
| 9 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ 𝐵) | |
| 10 | 9 | sselda 3937 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑦 ∈ 𝑈) → 𝑦 ∈ 𝐵) |
| 11 | 10 | adantrl 728 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝐵) |
| 12 | 1, 2 | mndcl 18795 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 13 | 5, 8, 11, 12 | syl3anc 1398 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 14 | 13 | ralrimivva 3208 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → ∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑈 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 15 | eqid 2763 | . . . . 5 ⊢ (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) = (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) | |
| 16 | 15 | fmpo 8061 | . . . 4 ⊢ (∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑈 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵 ↔ (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)):(𝑇 × 𝑈)⟶𝐵) |
| 17 | 14, 16 | sylib 221 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)):(𝑇 × 𝑈)⟶𝐵) |
| 18 | 17 | frnd 6714 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) ⊆ 𝐵) |
| 19 | 4, 18 | eqsstrd 3971 | 1 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ⊆ wss 3905 × cxp 5659 ran crn 5662 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 Basecbs 17264 +gcplusg 17305 Mndcmnd 18787 LSSumclsm 19699 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-mgm 18693 df-sgrp 18772 df-mnd 18788 df-lsm 19701 |
| This theorem is referenced by: lsmsubm 19718 lsmass 19734 lsmcntzr 19745 lsmsnorb 33704 ringlsmss 33706 lsmssass 33711 |
| Copyright terms: Public domain | W3C validator |