| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmub2x | Structured version Visualization version GIF version | ||
| Description: Subgroup sum is an upper bound of its arguments. (Contributed by NM, 6-Feb-2014.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmless2.v | ⊢ 𝐵 = (Base‘𝐺) |
| lsmless2.s | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmub2x | ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ (𝑇 ⊕ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | submrcl 19003 | . . . . . 6 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd) | |
| 2 | 1 | ad2antrr 739 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝐺 ∈ Mnd) |
| 3 | simpr 490 | . . . . . 6 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ 𝐵) | |
| 4 | 3 | sselda 3908 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ 𝐵) |
| 5 | lsmless2.v | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 6 | eqid 2760 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 7 | eqid 2760 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 8 | 5, 6, 7 | mndlid 18950 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ((0g‘𝐺)(+g‘𝐺)𝑥) = 𝑥) |
| 9 | 2, 4, 8 | syl2anc 596 | . . . 4 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → ((0g‘𝐺)(+g‘𝐺)𝑥) = 𝑥) |
| 10 | 5 | submss 19010 | . . . . . 6 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → 𝑇 ⊆ 𝐵) |
| 11 | 10 | ad2antrr 739 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑇 ⊆ 𝐵) |
| 12 | simplr 781 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑈 ⊆ 𝐵) | |
| 13 | 7 | subm0cl 19012 | . . . . . 6 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑇) |
| 14 | 13 | ad2antrr 739 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → (0g‘𝐺) ∈ 𝑇) |
| 15 | simpr 490 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ 𝑈) | |
| 16 | lsmless2.s | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
| 17 | 5, 6, 16 | lsmelvalix 19861 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ ((0g‘𝐺) ∈ 𝑇 ∧ 𝑥 ∈ 𝑈)) → ((0g‘𝐺)(+g‘𝐺)𝑥) ∈ (𝑇 ⊕ 𝑈)) |
| 18 | 2, 11, 12, 14, 15, 17 | syl32anc 1405 | . . . 4 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → ((0g‘𝐺)(+g‘𝐺)𝑥) ∈ (𝑇 ⊕ 𝑈)) |
| 19 | 9, 18 | eqeltrrd 2861 | . . 3 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ (𝑇 ⊕ 𝑈)) |
| 20 | 19 | ex 418 | . 2 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ 𝑈 → 𝑥 ∈ (𝑇 ⊕ 𝑈))) |
| 21 | 20 | ssrdv 3914 | 1 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ (𝑇 ⊕ 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ‘cfv 6539 (class class class)co 7421 Basecbs 17393 +gcplusg 17434 0gc0g 17616 Mndcmnd 18929 SubMndcsubmnd 18983 LSSumclsm 19854 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-2 12409 df-sets 17348 df-slot 17366 df-ndx 17378 df-base 17394 df-ress 17415 df-plusg 17447 df-0g 17618 df-mgm 18822 df-sgrp 18914 df-mnd 18930 df-submnd 18985 df-lsm 19856 |
| This theorem is used by: lsmub2 19878 |
| Copyright terms: Public domain | W3C validator |