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

Theorem sspba 31386
Description: The base set of a subspace is included in the parent base set. (Contributed by NM, 27-Jan-2008.) (New usage is discouraged.)
Hypotheses
Ref Expression
sspba.x 𝑋 = (BaseSet‘𝑈)
sspba.y 𝑌 = (BaseSet‘𝑊)
sspba.h 𝐻 = (SubSp‘𝑈)
Assertion
Ref Expression
sspba ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ 𝑋)

Proof of Theorem sspba
StepHypRef Expression
1 eqid 2763 . . . . . 6 ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈)
2 eqid 2763 . . . . . 6 ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊)
3 eqid 2763 . . . . . 6 ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
4 eqid 2763 . . . . . 6 ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊)
5 eqid 2763 . . . . . 6 (normCV‘𝑈) = (normCV‘𝑈)
6 eqid 2763 . . . . . 6 (normCV‘𝑊) = (normCV‘𝑊)
7 sspba.h . . . . . 6 𝐻 = (SubSp‘𝑈)
81, 2, 3, 4, 5, 6, 7isssp 31383 . . . . 5 (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ ( ·𝑠OLD ‘𝑊) ⊆ ( ·𝑠OLD ‘𝑈) ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈)))))
98simplbda 505 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ ( ·𝑠OLD ‘𝑊) ⊆ ( ·𝑠OLD ‘𝑈) ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈)))
109simp1d 1160 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈))
11 rnss 5933 . . 3 (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈))
1210, 11syl 18 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈))
13 sspba.y . . 3 𝑌 = (BaseSet‘𝑊)
1413, 2bafval 31263 . 2 𝑌 = ran ( +𝑣 ‘𝑊)
15 sspba.x . . 3 𝑋 = (BaseSet‘𝑈)
1615, 1bafval 31263 . 2 𝑋 = ran ( +𝑣 ‘𝑈)
1712, 14, 163sstr4g 3966 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ran crn 5659  ‘cfv 6566  NrmCVeccnv 31243   +𝑣 cpv 31244  BaseSetcba 31245   ·𝑠OLD cns 31246  normCVcnmcv 31249  SubSpcss 31380
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-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-rab 3417  df-v 3456  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-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-fo 6572  df-fv 6574  df-oprab 7455  df-1st 8035  df-2nd 8036  df-vc 31218  df-nv 31251  df-va 31254  df-ba 31255  df-sm 31256  df-nmcv 31259  df-ssp 31381
This theorem is used by:  sspg  31387  ssps  31389  sspmlem  31391  sspmval  31392  sspz  31394  sspn  31395  sspimsval  31397  minvecolem1  31533  minvecolem2  31534  minvecolem3  31535  minvecolem4b  31537  minvecolem4  31539  minvecolem5  31540  minvecolem6  31541  minvecolem7  31542
  Copyright terms: Public domain W3C validator