Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lsmlub | Structured version Visualization version GIF version |
Description: The least upper bound property of subgroup sum. (Contributed by NM, 6-Feb-2014.) (Revised by Mario Carneiro, 21-Jun-2014.) |
Ref | Expression |
---|---|
lsmub1.p | ⊢ ⊕ = (LSSum‘𝐺) |
Ref | Expression |
---|---|
lsmlub | ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) ↔ (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3 1135 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑈 ∈ (SubGrp‘𝐺)) | |
2 | lsmub1.p | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
3 | 2 | lsmless12 18859 | . . . . 5 ⊢ (((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈)) → (𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈)) |
4 | 3 | ex 416 | . . . 4 ⊢ ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈))) |
5 | 1, 1, 4 | syl2anc 587 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈))) |
6 | 2 | lsmidm 18860 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → (𝑈 ⊕ 𝑈) = 𝑈) |
7 | 6 | 3ad2ant3 1132 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑈 ⊕ 𝑈) = 𝑈) |
8 | 7 | sseq2d 3926 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈) ↔ (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
9 | 5, 8 | sylibd 242 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
10 | 2 | lsmub1 18854 | . . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑇)) |
11 | 10 | 3adant3 1129 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑇)) |
12 | sstr2 3901 | . . . 4 ⊢ (𝑆 ⊆ (𝑆 ⊕ 𝑇) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑆 ⊆ 𝑈)) | |
13 | 11, 12 | syl 17 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑆 ⊆ 𝑈)) |
14 | 2 | lsmub2 18855 | . . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺)) → 𝑇 ⊆ (𝑆 ⊕ 𝑇)) |
15 | 14 | 3adant3 1129 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑇 ⊆ (𝑆 ⊕ 𝑇)) |
16 | sstr2 3901 | . . . 4 ⊢ (𝑇 ⊆ (𝑆 ⊕ 𝑇) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑇 ⊆ 𝑈)) | |
17 | 15, 16 | syl 17 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑇 ⊆ 𝑈)) |
18 | 13, 17 | jcad 516 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → (𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈))) |
19 | 9, 18 | impbid 215 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) ↔ (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ⊆ wss 3860 ‘cfv 6339 (class class class)co 7155 SubGrpcsubg 18345 LSSumclsm 18831 |
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 2729 ax-rep 5159 ax-sep 5172 ax-nul 5179 ax-pow 5237 ax-pr 5301 ax-un 7464 ax-cnex 10636 ax-resscn 10637 ax-1cn 10638 ax-icn 10639 ax-addcl 10640 ax-addrcl 10641 ax-mulcl 10642 ax-mulrcl 10643 ax-mulcom 10644 ax-addass 10645 ax-mulass 10646 ax-distr 10647 ax-i2m1 10648 ax-1ne0 10649 ax-1rid 10650 ax-rnegex 10651 ax-rrecex 10652 ax-cnre 10653 ax-pre-lttri 10654 ax-pre-lttrn 10655 ax-pre-ltadd 10656 ax-pre-mulgt0 10657 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-nel 3056 df-ral 3075 df-rex 3076 df-reu 3077 df-rmo 3078 df-rab 3079 df-v 3411 df-sbc 3699 df-csb 3808 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-pss 3879 df-nul 4228 df-if 4424 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4802 df-iun 4888 df-br 5036 df-opab 5098 df-mpt 5116 df-tr 5142 df-id 5433 df-eprel 5438 df-po 5446 df-so 5447 df-fr 5486 df-we 5488 df-xp 5533 df-rel 5534 df-cnv 5535 df-co 5536 df-dm 5537 df-rn 5538 df-res 5539 df-ima 5540 df-pred 6130 df-ord 6176 df-on 6177 df-lim 6178 df-suc 6179 df-iota 6298 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7585 df-1st 7698 df-2nd 7699 df-wrecs 7962 df-recs 8023 df-rdg 8061 df-er 8304 df-en 8533 df-dom 8534 df-sdom 8535 df-pnf 10720 df-mnf 10721 df-xr 10722 df-ltxr 10723 df-le 10724 df-sub 10915 df-neg 10916 df-nn 11680 df-2 11742 df-ndx 16549 df-slot 16550 df-base 16552 df-sets 16553 df-ress 16554 df-plusg 16641 df-0g 16778 df-mgm 17923 df-sgrp 17972 df-mnd 17983 df-submnd 18028 df-grp 18177 df-minusg 18178 df-subg 18348 df-lsm 18833 |
This theorem is referenced by: lsmss1 18863 lsmss2 18865 lsmmod 18873 lsmcntz 18877 dprd2da 19237 dmdprdsplit2lem 19240 dprdsplit 19243 pgpfac1lem1 19269 lsmsp 19931 lspprabs 19940 lsmcv 19986 lrelat 36616 lsatexch 36645 lsatcvatlem 36651 lsatcvat 36652 dihjustlem 38818 dihord1 38820 dihord5apre 38864 lclkrlem2f 39114 lclkrlem2v 39130 lclkrslem2 39140 lcfrlem25 39169 lcfrlem35 39179 mapdlsm 39266 lspindp5 39372 |
Copyright terms: Public domain | W3C validator |