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 17967 | . . . . . 6 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd) | |
2 | 1 | ad2antrr 724 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝐺 ∈ Mnd) |
3 | simpr 487 | . . . . . 6 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ 𝐵) | |
4 | 3 | sselda 3967 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ 𝐵) |
5 | lsmless2.v | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
6 | eqid 2821 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
7 | eqid 2821 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
8 | 5, 6, 7 | mndlid 17931 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ((0g‘𝐺)(+g‘𝐺)𝑥) = 𝑥) |
9 | 2, 4, 8 | syl2anc 586 | . . . 4 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → ((0g‘𝐺)(+g‘𝐺)𝑥) = 𝑥) |
10 | 5 | submss 17974 | . . . . . 6 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → 𝑇 ⊆ 𝐵) |
11 | 10 | ad2antrr 724 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑇 ⊆ 𝐵) |
12 | simplr 767 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑈 ⊆ 𝐵) | |
13 | 7 | subm0cl 17976 | . . . . . 6 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑇) |
14 | 13 | ad2antrr 724 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → (0g‘𝐺) ∈ 𝑇) |
15 | simpr 487 | . . . . 5 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ 𝑈) | |
16 | lsmless2.s | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
17 | 5, 6, 16 | lsmelvalix 18766 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ ((0g‘𝐺) ∈ 𝑇 ∧ 𝑥 ∈ 𝑈)) → ((0g‘𝐺)(+g‘𝐺)𝑥) ∈ (𝑇 ⊕ 𝑈)) |
18 | 2, 11, 12, 14, 15, 17 | syl32anc 1374 | . . . 4 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → ((0g‘𝐺)(+g‘𝐺)𝑥) ∈ (𝑇 ⊕ 𝑈)) |
19 | 9, 18 | eqeltrrd 2914 | . . 3 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ (𝑇 ⊕ 𝑈)) |
20 | 19 | ex 415 | . 2 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ 𝑈 → 𝑥 ∈ (𝑇 ⊕ 𝑈))) |
21 | 20 | ssrdv 3973 | 1 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ⊆ 𝐵) → 𝑈 ⊆ (𝑇 ⊕ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ⊆ wss 3936 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 +gcplusg 16565 0gc0g 16713 Mndcmnd 17911 SubMndcsubmnd 17955 LSSumclsm 18759 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-0g 16715 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-submnd 17957 df-lsm 18761 |
This theorem is referenced by: lsmub2 18783 |
Copyright terms: Public domain | W3C validator |