| 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 30794 | . . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐻 = {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)}) |
| 6 | 5 | eleq2d 2822 | . 2 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ 𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)})) |
| 7 | fveq2 6840 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = ( +𝑣 ‘𝑊)) | |
| 8 | isssp.f | . . . . . 6 ⊢ 𝐹 = ( +𝑣 ‘𝑊) | |
| 9 | 7, 8 | eqtr4di 2789 | . . . . 5 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = 𝐹) |
| 10 | 9 | sseq1d 3953 | . . . 4 ⊢ (𝑤 = 𝑊 → (( +𝑣 ‘𝑤) ⊆ 𝐺 ↔ 𝐹 ⊆ 𝐺)) |
| 11 | fveq2 6840 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = ( ·𝑠OLD ‘𝑊)) | |
| 12 | isssp.r | . . . . . 6 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑊) | |
| 13 | 11, 12 | eqtr4di 2789 | . . . . 5 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = 𝑅) |
| 14 | 13 | sseq1d 3953 | . . . 4 ⊢ (𝑤 = 𝑊 → (( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ↔ 𝑅 ⊆ 𝑆)) |
| 15 | fveq2 6840 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = (normCV‘𝑊)) | |
| 16 | isssp.m | . . . . . 6 ⊢ 𝑀 = (normCV‘𝑊) | |
| 17 | 15, 16 | eqtr4di 2789 | . . . . 5 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = 𝑀) |
| 18 | 17 | sseq1d 3953 | . . . 4 ⊢ (𝑤 = 𝑊 → ((normCV‘𝑤) ⊆ 𝑁 ↔ 𝑀 ⊆ 𝑁)) |
| 19 | 10, 14, 18 | 3anbi123d 1439 | . . 3 ⊢ (𝑤 = 𝑊 → ((( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁) ↔ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))) |
| 20 | 19 | elrab 3634 | . 2 ⊢ (𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)} ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))) |
| 21 | 6, 20 | bitrdi 287 | 1 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 {crab 3389 ⊆ wss 3889 ‘cfv 6498 NrmCVeccnv 30655 +𝑣 cpv 30656 ·𝑠OLD cns 30658 normCVcnmcv 30661 SubSpcss 30792 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fo 6504 df-fv 6506 df-oprab 7371 df-1st 7942 df-2nd 7943 df-vc 30630 df-nv 30663 df-va 30666 df-sm 30668 df-nmcv 30671 df-ssp 30793 |
| This theorem is referenced by: sspid 30796 sspnv 30797 sspba 30798 sspg 30799 ssps 30801 sspn 30807 hhsst 31337 hhsssh2 31341 |
| Copyright terms: Public domain | W3C validator |