| 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 2761 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | lsmless2.s | . . 3 ⊢ ⊕ = (LSSum‘𝐺) | |
| 4 | 1, 2, 3 | lsmvalx 19670 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) = ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦))) |
| 5 | simpl1 1204 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝐺 ∈ Mnd) | |
| 6 | simp2 1149 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → 𝑇 ⊆ 𝐵) | |
| 7 | 6 | sselda 3934 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝐵) |
| 8 | 7 | adantrr 727 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝐵) |
| 9 | simp3 1150 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ 𝐵) | |
| 10 | 9 | sselda 3934 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑦 ∈ 𝑈) → 𝑦 ∈ 𝐵) |
| 11 | 10 | adantrl 726 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝐵) |
| 12 | 1, 2 | mndcl 18767 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 13 | 5, 8, 11, 12 | syl3anc 1389 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑈)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 14 | 13 | ralrimivva 3204 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → ∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑈 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 15 | eqid 2761 | . . . . 5 ⊢ (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) = (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) | |
| 16 | 15 | fmpo 8044 | . . . 4 ⊢ (∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑈 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵 ↔ (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)):(𝑇 × 𝑈)⟶𝐵) |
| 17 | 14, 16 | sylib 220 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)):(𝑇 × 𝑈)⟶𝐵) |
| 18 | 17 | frnd 6695 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → ran (𝑥 ∈ 𝑇, 𝑦 ∈ 𝑈 ↦ (𝑥(+g‘𝐺)𝑦)) ⊆ 𝐵) |
| 19 | 4, 18 | eqsstrd 3968 | 1 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∀wral 3075 ⊆ wss 3902 × cxp 5641 ran crn 5644 ⟶wf 6512 ‘cfv 6516 (class class class)co 7391 ∈ cmpo 7393 Basecbs 17236 +gcplusg 17277 Mndcmnd 18759 LSSumclsm 19665 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-ov 7394 df-oprab 7395 df-mpo 7396 df-1st 7965 df-2nd 7966 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-lsm 19667 |
| This theorem is referenced by: lsmsubm 19684 lsmass 19700 lsmcntzr 19711 lsmsnorb 33538 ringlsmss 33542 lsmssass 33549 |
| Copyright terms: Public domain | W3C validator |