![]() |
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 1136 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑈 ∈ (SubGrp‘𝐺)) | |
2 | lsmub1.p | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
3 | 2 | lsmless12 19573 | . . . . 5 ⊢ (((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈)) → (𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈)) |
4 | 3 | ex 411 | . . . 4 ⊢ ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈))) |
5 | 1, 1, 4 | syl2anc 582 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈))) |
6 | 2 | lsmidm 19574 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → (𝑈 ⊕ 𝑈) = 𝑈) |
7 | 6 | 3ad2ant3 1133 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑈 ⊕ 𝑈) = 𝑈) |
8 | 7 | sseq2d 4015 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑈) ↔ (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
9 | 5, 8 | sylibd 238 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) → (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
10 | 2 | lsmub1 19568 | . . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑇)) |
11 | 10 | 3adant3 1130 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑇)) |
12 | sstr2 3990 | . . . 4 ⊢ (𝑆 ⊆ (𝑆 ⊕ 𝑇) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑆 ⊆ 𝑈)) | |
13 | 11, 12 | syl 17 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑆 ⊆ 𝑈)) |
14 | 2 | lsmub2 19569 | . . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺)) → 𝑇 ⊆ (𝑆 ⊕ 𝑇)) |
15 | 14 | 3adant3 1130 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑇 ⊆ (𝑆 ⊕ 𝑇)) |
16 | sstr2 3990 | . . . 4 ⊢ (𝑇 ⊆ (𝑆 ⊕ 𝑇) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑇 ⊆ 𝑈)) | |
17 | 15, 16 | syl 17 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → 𝑇 ⊆ 𝑈)) |
18 | 13, 17 | jcad 511 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑇) ⊆ 𝑈 → (𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈))) |
19 | 9, 18 | impbid 211 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → ((𝑆 ⊆ 𝑈 ∧ 𝑇 ⊆ 𝑈) ↔ (𝑆 ⊕ 𝑇) ⊆ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ⊆ wss 3949 ‘cfv 6544 (class class class)co 7413 SubGrpcsubg 19038 LSSumclsm 19545 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-er 8707 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-nn 12219 df-2 12281 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17151 df-ress 17180 df-plusg 17216 df-0g 17393 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-submnd 18708 df-grp 18860 df-minusg 18861 df-subg 19041 df-lsm 19547 |
This theorem is referenced by: lsmss1 19576 lsmss2 19578 lsmmod 19586 lsmcntz 19590 dprd2da 19955 dmdprdsplit2lem 19958 dprdsplit 19961 pgpfac1lem1 19987 lsmsp 20843 lspprabs 20852 lsmcv 20901 lrelat 38189 lsatexch 38218 lsatcvatlem 38224 lsatcvat 38225 dihjustlem 40392 dihord1 40394 dihord5apre 40438 lclkrlem2f 40688 lclkrlem2v 40704 lclkrslem2 40714 lcfrlem25 40743 lcfrlem35 40753 mapdlsm 40840 lspindp5 40946 |
Copyright terms: Public domain | W3C validator |