| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmless2x | Structured version Visualization version GIF version | ||
| Description: Subset implies subgroup sum subset (extended domain version). (Contributed by NM, 25-Feb-2014.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmless2.v | ⊢ 𝐵 = (Base‘𝐺) |
| lsmless2.s | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmless2x | ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑅 ⊕ 𝑇) ⊆ (𝑅 ⊕ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrexv 3983 | . . . . 5 ⊢ (𝑇 ⊆ 𝑈 → (∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) | |
| 2 | 1 | reximdv 3181 | . . . 4 ⊢ (𝑇 ⊆ 𝑈 → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 3 | 2 | adantl 487 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 4 | simpl1 1210 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝐺 ∈ 𝑉) | |
| 5 | simpl2 1211 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑅 ⊆ 𝐵) | |
| 6 | simpr 490 | . . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑇 ⊆ 𝑈) | |
| 7 | simpl3 1212 | . . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑈 ⊆ 𝐵) | |
| 8 | 6, 7 | sstrd 3923 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑇 ⊆ 𝐵) |
| 9 | lsmless2.v | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 10 | eqid 2763 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 11 | lsmless2.s | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 12 | 9, 10, 11 | lsmelvalx 19905 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑥 ∈ (𝑅 ⊕ 𝑇) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 13 | 4, 5, 8, 12 | syl3anc 1399 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑥 ∈ (𝑅 ⊕ 𝑇) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 14 | 9, 10, 11 | lsmelvalx 19905 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 15 | 14 | adantr 486 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 16 | 3, 13, 15 | 3imtr4d 297 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑥 ∈ (𝑅 ⊕ 𝑇) → 𝑥 ∈ (𝑅 ⊕ 𝑈))) |
| 17 | 16 | ssrdv 3919 | 1 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑅 ⊕ 𝑇) ⊆ (𝑅 ⊕ 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 ⊆ wss 3900 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 LSSumclsm 19899 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-lsm 19901 |
| This theorem is used by: lsmless2 19926 lsmssspx 21414 |
| Copyright terms: Public domain | W3C validator |