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

Theorem lss1 21036
Description: The set of vectors in a left module is a subspace. (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.)
Hypotheses
Ref Expression
lssss.v 𝑉 = (Base‘𝑊)
lssss.s 𝑆 = (LSubSp‘𝑊)
Assertion
Ref Expression
lss1 (𝑊 ∈ LMod → 𝑉𝑆)

Proof of Theorem lss1
Dummy variables 𝑎 𝑏 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2770 . 2 (𝑊 ∈ LMod → (Scalar‘𝑊) = (Scalar‘𝑊))
2 eqidd 2770 . 2 (𝑊 ∈ LMod → (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊)))
3 lssss.v . . 3 𝑉 = (Base‘𝑊)
43a1i 11 . 2 (𝑊 ∈ LMod → 𝑉 = (Base‘𝑊))
5 eqidd 2770 . 2 (𝑊 ∈ LMod → (+g𝑊) = (+g𝑊))
6 eqidd 2770 . 2 (𝑊 ∈ LMod → ( ·𝑠𝑊) = ( ·𝑠𝑊))
7 lssss.s . . 3 𝑆 = (LSubSp‘𝑊)
87a1i 11 . 2 (𝑊 ∈ LMod → 𝑆 = (LSubSp‘𝑊))
9 ssidd 3968 . 2 (𝑊 ∈ LMod → 𝑉𝑉)
103lmodbn0 20969 . 2 (𝑊 ∈ LMod → 𝑉 ≠ ∅)
11 simpl 487 . . 3 ((𝑊 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑎𝑉𝑏𝑉)) → 𝑊 ∈ LMod)
12 eqid 2769 . . . . 5 (Scalar‘𝑊) = (Scalar‘𝑊)
13 eqid 2769 . . . . 5 ( ·𝑠𝑊) = ( ·𝑠𝑊)
14 eqid 2769 . . . . 5 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
153, 12, 13, 14lmodvscl 20976 . . . 4 ((𝑊 ∈ LMod ∧ 𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑎𝑉) → (𝑥( ·𝑠𝑊)𝑎) ∈ 𝑉)
16153adant3r3 1201 . . 3 ((𝑊 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑎𝑉𝑏𝑉)) → (𝑥( ·𝑠𝑊)𝑎) ∈ 𝑉)
17 simpr3 1213 . . 3 ((𝑊 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑎𝑉𝑏𝑉)) → 𝑏𝑉)
18 eqid 2769 . . . 4 (+g𝑊) = (+g𝑊)
193, 18lmodvacl 20973 . . 3 ((𝑊 ∈ LMod ∧ (𝑥( ·𝑠𝑊)𝑎) ∈ 𝑉𝑏𝑉) → ((𝑥( ·𝑠𝑊)𝑎)(+g𝑊)𝑏) ∈ 𝑉)
2011, 16, 17, 19syl3anc 1396 . 2 ((𝑊 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑎𝑉𝑏𝑉)) → ((𝑥( ·𝑠𝑊)𝑎)(+g𝑊)𝑏) ∈ 𝑉)
211, 2, 4, 5, 6, 8, 9, 10, 20islssd 21033 1 (𝑊 ∈ LMod → 𝑉𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1567  wcel 2149  cfv 6537  (class class class)co 7411  Basecbs 17268  +gcplusg 17309  Scalarcsca 17312   ·𝑠 cvsca 17313  LModclmod 20958  LSubSpclss 21029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7368  df-ov 7414  df-0g 17493  df-mgm 18697  df-sgrp 18776  df-mnd 18792  df-grp 19002  df-lmod 20960  df-lss 21030
This theorem is referenced by:  lssuni  21037  islss3  21057  lssmre  21064  lspf  21072  lspval  21073  lmhmrnlss  21148  lidl1ALT  21334  isphld  21772  ocv1  21797  aspval  21990  islshpcv  39716  dochexmidlem8  42130  hdmaprnlem4N  42516  lnmfg  43700
  Copyright terms: Public domain W3C validator