| 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 2765 | . . . . . 6 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 2 | eqid 2765 | . . . . . 6 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊) | |
| 3 | eqid 2765 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 4 | eqid 2765 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊) | |
| 5 | eqid 2765 | . . . . . 6 ⊢ (normCV‘𝑈) = (normCV‘𝑈) | |
| 6 | eqid 2765 | . . . . . 6 ⊢ (normCV‘𝑊) = (normCV‘𝑊) | |
| 7 | sspba.h | . . . . . 6 ⊢ 𝐻 = (SubSp‘𝑈) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | isssp 31149 | . . . . 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 5931 | . . 3 ⊢ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈)) | |
| 12 | 10, 11 | syl 18 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ran ( +𝑣 ‘𝑊) ⊆ ran ( +𝑣 ‘𝑈)) |
| 13 | sspba.y | . . 3 ⊢ 𝑌 = (BaseSet‘𝑊) | |
| 14 | 13, 2 | bafval 31029 | . 2 ⊢ 𝑌 = ran ( +𝑣 ‘𝑊) |
| 15 | sspba.x | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 16 | 15, 1 | bafval 31029 | . 2 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 17 | 12, 14, 16 | 3sstr4g 3991 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 ran crn 5664 ‘cfv 6540 NrmCVeccnv 31009 +𝑣 cpv 31010 BaseSetcba 31011 ·𝑠OLD cns 31012 normCVcnmcv 31015 SubSpcss 31146 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fo 6546 df-fv 6548 df-oprab 7423 df-1st 7992 df-2nd 7993 df-vc 30984 df-nv 31017 df-va 31020 df-ba 31021 df-sm 31022 df-nmcv 31025 df-ssp 31147 |
| This theorem is used by: sspg 31153 ssps 31155 sspmlem 31157 sspmval 31158 sspz 31160 sspn 31161 sspimsval 31163 minvecolem1 31299 minvecolem2 31300 minvecolem3 31301 minvecolem4b 31303 minvecolem4 31305 minvecolem5 31306 minvecolem6 31307 minvecolem7 31308 |
| Copyright terms: Public domain | W3C validator |