| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isssp | Structured version Visualization version GIF version | ||
| Description: The predicate "is a subspace." (Contributed by NM, 26-Jan-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| isssp.g | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| isssp.f | ⊢ 𝐹 = ( +𝑣 ‘𝑊) |
| isssp.s | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| isssp.r | ⊢ 𝑅 = ( ·𝑠OLD ‘𝑊) |
| isssp.n | ⊢ 𝑁 = (normCV‘𝑈) |
| isssp.m | ⊢ 𝑀 = (normCV‘𝑊) |
| isssp.h | ⊢ 𝐻 = (SubSp‘𝑈) |
| Ref | Expression |
|---|---|
| isssp | ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isssp.g | . . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 2 | isssp.s | . . . 4 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 3 | isssp.n | . . . 4 ⊢ 𝑁 = (normCV‘𝑈) | |
| 4 | isssp.h | . . . 4 ⊢ 𝐻 = (SubSp‘𝑈) | |
| 5 | 1, 2, 3, 4 | sspval 31012 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐻 = {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)}) |
| 6 | 5 | eleq2d 2855 | . 2 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ 𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)})) |
| 7 | fveq2 6879 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = ( +𝑣 ‘𝑊)) | |
| 8 | isssp.f | . . . . . 6 ⊢ 𝐹 = ( +𝑣 ‘𝑊) | |
| 9 | 7, 8 | eqtr4di 2822 | . . . . 5 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = 𝐹) |
| 10 | 9 | sseq1d 3976 | . . . 4 ⊢ (𝑤 = 𝑊 → (( +𝑣 ‘𝑤) ⊆ 𝐺 ↔ 𝐹 ⊆ 𝐺)) |
| 11 | fveq2 6879 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = ( ·𝑠OLD ‘𝑊)) | |
| 12 | isssp.r | . . . . . 6 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑊) | |
| 13 | 11, 12 | eqtr4di 2822 | . . . . 5 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = 𝑅) |
| 14 | 13 | sseq1d 3976 | . . . 4 ⊢ (𝑤 = 𝑊 → (( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ↔ 𝑅 ⊆ 𝑆)) |
| 15 | fveq2 6879 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = (normCV‘𝑊)) | |
| 16 | isssp.m | . . . . . 6 ⊢ 𝑀 = (normCV‘𝑊) | |
| 17 | 15, 16 | eqtr4di 2822 | . . . . 5 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = 𝑀) |
| 18 | 17 | sseq1d 3976 | . . . 4 ⊢ (𝑤 = 𝑊 → ((normCV‘𝑤) ⊆ 𝑁 ↔ 𝑀 ⊆ 𝑁)) |
| 19 | 10, 14, 18 | 3anbi123d 1462 | . . 3 ⊢ (𝑤 = 𝑊 → ((( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁) ↔ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))) |
| 20 | 19 | elrab 3659 | . 2 ⊢ (𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)} ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))) |
| 21 | 6, 20 | bitrdi 290 | 1 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 {crab 3423 ⊆ wss 3913 ‘cfv 6534 NrmCVeccnv 30873 +𝑣 cpv 30874 ·𝑠OLD cns 30876 normCVcnmcv 30879 SubSpcss 31010 |
| 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 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 |
| 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 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-fo 6540 df-fv 6542 df-oprab 7412 df-1st 7982 df-2nd 7983 df-vc 30848 df-nv 30881 df-va 30884 df-sm 30886 df-nmcv 30889 df-ssp 31011 |
| This theorem is referenced by: sspid 31014 sspnv 31015 sspba 31016 sspg 31017 ssps 31019 sspn 31025 hhsst 31555 hhsssh2 31559 |
| Copyright terms: Public domain | W3C validator |