![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lsmub1x | Structured version Visualization version GIF version |
Description: Subgroup sum is an upper bound of its arguments. (Contributed by Mario Carneiro, 19-Apr-2016.) |
Ref | Expression |
---|---|
lsmless2.v | ⊢ 𝐵 = (Base‘𝐺) |
lsmless2.s | ⊢ ⊕ = (LSSum‘𝐺) |
Ref | Expression |
---|---|
lsmub1x | ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) → 𝑇 ⊆ (𝑇 ⊕ 𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | submrcl 17959 | . . . . . 6 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd) | |
2 | 1 | ad2antlr 726 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝐺 ∈ Mnd) |
3 | simpll 766 | . . . . . 6 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑇 ⊆ 𝐵) | |
4 | simpr 488 | . . . . . 6 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝑇) | |
5 | 3, 4 | sseldd 3916 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝐵) |
6 | lsmless2.v | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
7 | eqid 2798 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
8 | eqid 2798 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
9 | 6, 7, 8 | mndrid 17924 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
10 | 2, 5, 9 | syl2anc 587 | . . . 4 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
11 | 6 | submss 17966 | . . . . . 6 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → 𝑈 ⊆ 𝐵) |
12 | 11 | ad2antlr 726 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑈 ⊆ 𝐵) |
13 | 8 | subm0cl 17968 | . . . . . 6 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑈) |
14 | 13 | ad2antlr 726 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → (0g‘𝐺) ∈ 𝑈) |
15 | lsmless2.s | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
16 | 6, 7, 15 | lsmelvalix 18758 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ (0g‘𝐺) ∈ 𝑈)) → (𝑥(+g‘𝐺)(0g‘𝐺)) ∈ (𝑇 ⊕ 𝑈)) |
17 | 2, 3, 12, 4, 14, 16 | syl32anc 1375 | . . . 4 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → (𝑥(+g‘𝐺)(0g‘𝐺)) ∈ (𝑇 ⊕ 𝑈)) |
18 | 10, 17 | eqeltrrd 2891 | . . 3 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ (𝑇 ⊕ 𝑈)) |
19 | 18 | ex 416 | . 2 ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) → (𝑥 ∈ 𝑇 → 𝑥 ∈ (𝑇 ⊕ 𝑈))) |
20 | 19 | ssrdv 3921 | 1 ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) → 𝑇 ⊆ (𝑇 ⊕ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ⊆ wss 3881 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 +gcplusg 16557 0gc0g 16705 Mndcmnd 17903 SubMndcsubmnd 17947 LSSumclsm 18751 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-submnd 17949 df-lsm 18753 |
This theorem is referenced by: lsmsubm 18770 smndlsmidm 18773 lsmub1 18774 |
Copyright terms: Public domain | W3C validator |