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 17961 | . . . . . 6 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd) | |
2 | 1 | ad2antlr 725 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝐺 ∈ Mnd) |
3 | simpll 765 | . . . . . 6 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑇 ⊆ 𝐵) | |
4 | simpr 487 | . . . . . 6 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝑇) | |
5 | 3, 4 | sseldd 3967 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝐵) |
6 | lsmless2.v | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
7 | eqid 2821 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
8 | eqid 2821 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
9 | 6, 7, 8 | mndrid 17926 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
10 | 2, 5, 9 | syl2anc 586 | . . . 4 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
11 | 6 | submss 17968 | . . . . . 6 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → 𝑈 ⊆ 𝐵) |
12 | 11 | ad2antlr 725 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑈 ⊆ 𝐵) |
13 | 8 | subm0cl 17970 | . . . . . 6 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑈) |
14 | 13 | ad2antlr 725 | . . . . 5 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → (0g‘𝐺) ∈ 𝑈) |
15 | lsmless2.s | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
16 | 6, 7, 15 | lsmelvalix 18760 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑥 ∈ 𝑇 ∧ (0g‘𝐺) ∈ 𝑈)) → (𝑥(+g‘𝐺)(0g‘𝐺)) ∈ (𝑇 ⊕ 𝑈)) |
17 | 2, 3, 12, 4, 14, 16 | syl32anc 1374 | . . . 4 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → (𝑥(+g‘𝐺)(0g‘𝐺)) ∈ (𝑇 ⊕ 𝑈)) |
18 | 10, 17 | eqeltrrd 2914 | . . 3 ⊢ (((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ (𝑇 ⊕ 𝑈)) |
19 | 18 | ex 415 | . 2 ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) → (𝑥 ∈ 𝑇 → 𝑥 ∈ (𝑇 ⊕ 𝑈))) |
20 | 19 | ssrdv 3972 | 1 ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑈 ∈ (SubMnd‘𝐺)) → 𝑇 ⊆ (𝑇 ⊕ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ⊆ wss 3935 ‘cfv 6349 (class class class)co 7150 Basecbs 16477 +gcplusg 16559 0gc0g 16707 Mndcmnd 17905 SubMndcsubmnd 17949 LSSumclsm 18753 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-plusg 16572 df-0g 16709 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-submnd 17951 df-lsm 18755 |
This theorem is referenced by: lsmsubm 18772 smndlsmidm 18775 lsmub1 18776 |
Copyright terms: Public domain | W3C validator |