| 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 19904 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦))) |
| 5 | simpl1 1210 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝐺 ∈ Mnd) | |
| 6 | simp2 1155 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → 𝑇 ⊆ 𝐵) | |
| 7 | 6 | sselda 3913 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝐵) |
| 8 | 7 | adantrr 730 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝐵) |
| 9 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ 𝐵) | |
| 10 | 9 | sselda 3913 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑦 ∈ 𝑈) → 𝑦 ∈ 𝐵) |
| 11 | 10 | adantrl 729 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝐵) |
| 12 | 1, 2 | mndcl 18981 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 13 | 5, 8, 11, 12 | syl3anc 1399 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 14 | 13 | ralrimivva 3209 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → ∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑈 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 15 | eqid 2763 | . . . . 5 ⊢ (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) = (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) | |
| 16 | 15 | fmpo 8114 | . . . 4 ⊢ (∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑈 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵 ↔ (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)):(𝑇 × 𝑈)⟶𝐵) |
| 17 | 14, 16 | sylib 221 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)):(𝑇 × 𝑈)⟶𝐵) |
| 18 | 17 | frnd 6748 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) ⊆ 𝐵) |
| 19 | 4, 18 | eqsstrd 3947 | 1 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 × cxp 5656 ran crn 5659 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 Basecbs 17431 +gcplusg 17472 Mndcmnd 18973 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-mgm 18866 df-sgrp 18958 df-mnd 18974 df-lsm 19901 |
| This theorem is used by: lsmsubm 19918 lsmass 19934 lsmcntzr 19945 lsmsnorb 34050 ringlsmss 34052 lsmssass 34057 |
| Copyright terms: Public domain | W3C validator |