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 3993 | . . . 4 ⊢ (𝑅 ⊆ 𝑇 → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) | |
2 | 1 | adantl 482 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
3 | simpl1 1190 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝐺 ∈ 𝑉) | |
4 | simpr 485 | . . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑅 ⊆ 𝑇) | |
5 | simpl2 1191 | . . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑇 ⊆ 𝐵) | |
6 | 4, 5 | sstrd 3936 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑅 ⊆ 𝐵) |
7 | simpl3 1192 | . . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → 𝑈 ⊆ 𝐵) | |
8 | lsmless2.v | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
9 | eqid 2740 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
10 | lsmless2.s | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
11 | 8, 9, 10 | lsmelvalx 19243 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
12 | 3, 6, 7, 11 | syl3anc 1370 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
13 | 8, 9, 10 | lsmelvalx 19243 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
14 | 13 | adantr 481 | . . 3 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
15 | 2, 12, 14 | 3imtr4d 294 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑥 ∈ (𝑅 ⊕ 𝑈) → 𝑥 ∈ (𝑇 ⊕ 𝑈))) |
16 | 15 | ssrdv 3932 | 1 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑅 ⊆ 𝑇) → (𝑅 ⊕ 𝑈) ⊆ (𝑇 ⊕ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1542 ∈ wcel 2110 ∃wrex 3067 ⊆ wss 3892 ‘cfv 6432 (class class class)co 7271 Basecbs 16910 +gcplusg 16960 LSSumclsm 19237 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5490 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-ov 7274 df-oprab 7275 df-mpo 7276 df-1st 7824 df-2nd 7825 df-lsm 19239 |
This theorem is referenced by: lsmless1 19263 lsmless12 19265 lsmssspx 20348 |
Copyright terms: Public domain | W3C validator |