| 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 2760 | . . . . . 6 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 2 | eqid 2760 | . . . . . 6 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊) | |
| 3 | eqid 2760 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 4 | eqid 2760 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊) | |
| 5 | eqid 2760 | . . . . . 6 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 6 | eqid 2760 | . . . . . 6 ⊢ (normCV‘𝑊) = (normCV‘𝑊) | |
| 7 | sspba.h | . . . . . 6 ⊢ 𝐻 = (SubSp‘𝑈) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | isssp 31206 | . . . . 5 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ ( ·𝑠OLD ‘𝑊) ⊆ ( ·𝑠OLD ‘𝑈) ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈))))) |
| 9 | 8 | simplbda 505 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ ( ·𝑠OLD ‘𝑊) ⊆ ( ·𝑠OLD ‘𝑈) ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈))) |
| 10 | 9 | simp1d 1160 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈)) |
| 11 | rnss 5923 | . . 3 ⊢ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈)) | |
| 12 | 10, 11 | syl 18 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈)) |
| 13 | sspba.y | . . 3 ⊢ 𝑌 = (BaseSet‘𝑊) | |
| 14 | 13, 2 | bafval 31086 | . 2 ⊢ 𝑌 = ran ( +𝑣 ‘𝑊) |
| 15 | sspba.x | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 16 | 15, 1 | bafval 31086 | . 2 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 17 | 12, 14, 16 | 3sstr4g 3984 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ran crn 5656 ‘cfv 6533 NrmCVeccnv 31066 +𝑣 cpv 31067 BaseSetcba 31068 ·𝑠OLD cns 31069 normCVcnmcv 31072 SubSpcss 31203 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 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-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fo 6539 df-fv 6541 df-oprab 7418 df-1st 7987 df-2nd 7988 df-vc 31041 df-nv 31074 df-va 31077 df-ba 31078 df-sm 31079 df-nmcv 31082 df-ssp 31204 |
| This theorem is used by: sspg 31210 ssps 31212 sspmlem 31214 sspmval 31215 sspz 31217 sspn 31218 sspimsval 31220 minvecolem1 31356 minvecolem2 31357 minvecolem3 31358 minvecolem4b 31360 minvecolem4 31362 minvecolem5 31363 minvecolem6 31364 minvecolem7 31365 |
| Copyright terms: Public domain | W3C validator |