| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmless1x | Structured version Visualization version GIF version | ||
| Description: Subset implies subgroup sum subset (extended domain version). (Contributed by NM, 22-Feb-2014.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmless2.v | ⊢ 𝐵 = (Base‘𝐺) |
| lsmless2.s | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmless1x | ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑅 ⊕ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrexv 3986 | . . . 4 ⊢ (𝑅 ⊆ 𝑇 → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) | |
| 2 | 1 | adantl 483 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 3 | simpl1 1199 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝐺 ∈ 𝑉) | |
| 4 | simpr 486 | . . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑅 ⊆ 𝑇) | |
| 5 | simpl2 1200 | . . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑇 ⊆ 𝐵) | |
| 6 | 4, 5 | sstrd 3926 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑅 ⊆ 𝐵) |
| 7 | simpl3 1201 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑈 ⊆ 𝐵) | |
| 8 | lsmless2.v | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 9 | eqid 2741 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 10 | lsmless2.s | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 11 | 8, 9, 10 | lsmelvalx 19609 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 12 | 3, 6, 7, 11 | syl3anc 1380 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 13 | 8, 9, 10 | lsmelvalx 19609 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 14 | 13 | adantr 482 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 15 | 2, 12, 14 | 3imtr4d 296 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑥 ∈ (𝑅 ⊕ 𝑈) → 𝑥 ∈ (𝑇 ⊕ 𝑈))) |
| 16 | 15 | ssrdv 3922 | 1 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑅 ⊕ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ∃wrex 3065 ⊆ wss 3884 ‘cfv 6488 (class class class)co 7359 Basecbs 17174 +gcplusg 17215 LSSumclsm 19603 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-ov 7362 df-oprab 7363 df-mpo 7364 df-1st 7933 df-2nd 7934 df-lsm 19605 |
| This theorem is referenced by: lsmless1 19629 lsmless12 19631 lsmssspx 21081 |
| Copyright terms: Public domain | W3C validator |