| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sspba | Structured version Visualization version GIF version | ||
| Description: The base set of a subspace is included in the parent base set. (Contributed by NM, 27-Jan-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sspba.x | ⊢ 𝑋 = (BaseSet‘𝑈) |
| sspba.y | ⊢ 𝑌 = (BaseSet‘𝑊) |
| sspba.h | ⊢ 𝐻 = (SubSp‘𝑈) |
| Ref | Expression |
|---|---|
| sspba | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2769 | . . . . . 6 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 2 | eqid 2769 | . . . . . 6 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊) | |
| 3 | eqid 2769 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 4 | eqid 2769 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊) | |
| 5 | eqid 2769 | . . . . . 6 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 6 | eqid 2769 | . . . . . 6 ⊢ (normCV‘𝑊) = (normCV‘𝑊) | |
| 7 | sspba.h | . . . . . 6 ⊢ 𝐻 = (SubSp‘𝑈) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | isssp 31016 | . . . . 5 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ ( ·𝑠OLD ‘𝑊) ⊆ ( ·𝑠OLD ‘𝑈) ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈))))) |
| 9 | 8 | simplbda 504 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ ( ·𝑠OLD ‘𝑊) ⊆ ( ·𝑠OLD ‘𝑈) ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈))) |
| 10 | 9 | simp1d 1158 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈)) |
| 11 | rnss 5930 | . . 3 ⊢ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈)) | |
| 12 | 10, 11 | syl 18 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈)) |
| 13 | sspba.y | . . 3 ⊢ 𝑌 = (BaseSet‘𝑊) | |
| 14 | 13, 2 | bafval 30896 | . 2 ⊢ 𝑌 = ran ( +𝑣 ‘𝑊) |
| 15 | sspba.x | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 16 | 15, 1 | bafval 30896 | . 2 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 17 | 12, 14, 16 | 3sstr4g 3998 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 ran crn 5663 ‘cfv 6537 NrmCVeccnv 30876 +𝑣 cpv 30877 BaseSetcba 30878 ·𝑠OLD cns 30879 normCVcnmcv 30882 SubSpcss 31013 |
| 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 ax-un 7733 |
| 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-rab 3424 df-v 3465 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-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fo 6543 df-fv 6545 df-oprab 7415 df-1st 7985 df-2nd 7986 df-vc 30851 df-nv 30884 df-va 30887 df-ba 30888 df-sm 30889 df-nmcv 30892 df-ssp 31014 |
| This theorem is referenced by: sspg 31020 ssps 31022 sspmlem 31024 sspmval 31025 sspz 31027 sspn 31028 sspimsval 31030 minvecolem1 31166 minvecolem2 31167 minvecolem3 31168 minvecolem4b 31170 minvecolem4 31172 minvecolem5 31173 minvecolem6 31174 minvecolem7 31175 |
| Copyright terms: Public domain | W3C validator |