MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lsmless2x Structured version   Visualization version   GIF version

Theorem lsmless2x 19852
Description: Subset implies subgroup sum subset (extended domain version). (Contributed by NM, 25-Feb-2014.) (Revised by Mario Carneiro, 19-Apr-2016.)
Hypotheses
Ref Expression
lsmless2.v 𝐵 = (Base‘𝐺)
lsmless2.s ⊕ = (LSSum‘𝐺)
Assertion
Ref Expression
lsmless2x (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑅 ⊕ 𝑇) ⊆ (𝑅 ⊕ 𝑈))

Proof of Theorem lsmless2x
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssrexv 4001 . . . . 5 (𝑇 ⊆ 𝑈 → (∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧)))
21reximdv 3178 . . . 4 (𝑇 ⊆ 𝑈 → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧)))
32adantl 487 . . 3 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧) → ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧)))
4 simpl1 1210 . . . 4 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝐺 ∈ 𝑉)
5 simpl2 1211 . . . 4 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑅 ⊆ 𝐵)
6 simpr 490 . . . . 5 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑇 ⊆ 𝑈)
7 simpl3 1212 . . . . 5 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑈 ⊆ 𝐵)
86, 7sstrd 3941 . . . 4 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → 𝑇 ⊆ 𝐵)
9 lsmless2.v . . . . 5 𝐵 = (Base‘𝐺)
10 eqid 2761 . . . . 5 (+g‘𝐺) = (+g‘𝐺)
11 lsmless2.s . . . . 5 ⊕ = (LSSum‘𝐺)
129, 10, 11lsmelvalx 19847 . . . 4 ((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑥 ∈ (𝑅 ⊕ 𝑇) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧)))
134, 5, 8, 12syl3anc 1398 . . 3 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑥 ∈ (𝑅 ⊕ 𝑇) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑇 𝑥 = (𝑦(+g‘𝐺)𝑧)))
149, 10, 11lsmelvalx 19847 . . . 4 ((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧)))
1514adantr 486 . . 3 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑥 ∈ (𝑅 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑅 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧)))
163, 13, 153imtr4d 297 . 2 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑥 ∈ (𝑅 ⊕ 𝑇) → 𝑥 ∈ (𝑅 ⊕ 𝑈)))
1716ssrdv 3937 1 (((𝐺 ∈ 𝑉 ∧ 𝑅 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑇 ⊆ 𝑈) → (𝑅 ⊕ 𝑇) ⊆ (𝑅 ⊕ 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   ⊆ wss 3899  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +gcplusg 17421  LSSumclsm 19841
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-lsm 19843
This theorem is used by:  lsmless2  19868  lsmssspx  21356
  Copyright terms: Public domain W3C validator