| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lssvscl | Structured version Visualization version GIF version | ||
| Description: Closure of scalar product in a subspace. (Contributed by NM, 11-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lssvscl.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lssvscl.t | ⊢ · = ( ·𝑠 ‘𝑊) |
| lssvscl.b | ⊢ 𝐵 = (Base‘𝐹) |
| lssvscl.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| Ref | Expression |
|---|---|
| lssvscl | ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (𝑋 · 𝑌) ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 767 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑊 ∈ LMod) | |
| 2 | simprl 771 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑋 ∈ 𝐵) | |
| 3 | eqid 2737 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 4 | lssvscl.s | . . . . . 6 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 5 | 3, 4 | lssel 20923 | . . . . 5 ⊢ ((𝑈 ∈ 𝑆 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ (Base‘𝑊)) |
| 6 | 5 | ad2ant2l 747 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑌 ∈ (Base‘𝑊)) |
| 7 | lssvscl.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 8 | lssvscl.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 9 | lssvscl.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 10 | 3, 7, 8, 9 | lmodvscl 20864 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ (Base‘𝑊)) → (𝑋 · 𝑌) ∈ (Base‘𝑊)) |
| 11 | 1, 2, 6, 10 | syl3anc 1374 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (𝑋 · 𝑌) ∈ (Base‘𝑊)) |
| 12 | eqid 2737 | . . . 4 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 13 | eqid 2737 | . . . 4 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 14 | 3, 12, 13 | lmod0vrid 20879 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑋 · 𝑌) ∈ (Base‘𝑊)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) = (𝑋 · 𝑌)) |
| 15 | 1, 11, 14 | syl2anc 585 | . 2 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) = (𝑋 · 𝑌)) |
| 16 | simplr 769 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑈 ∈ 𝑆) | |
| 17 | simprr 773 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → 𝑌 ∈ 𝑈) | |
| 18 | 13, 4 | lss0cl 20933 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (0g‘𝑊) ∈ 𝑈) |
| 19 | 18 | adantr 480 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (0g‘𝑊) ∈ 𝑈) |
| 20 | 7, 9, 12, 8, 4 | lsscl 20928 | . . 3 ⊢ ((𝑈 ∈ 𝑆 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈 ∧ (0g‘𝑊) ∈ 𝑈)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) ∈ 𝑈) |
| 21 | 16, 2, 17, 19, 20 | syl13anc 1375 | . 2 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → ((𝑋 · 𝑌)(+g‘𝑊)(0g‘𝑊)) ∈ 𝑈) |
| 22 | 15, 21 | eqeltrrd 2838 | 1 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (𝑋 · 𝑌) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 +gcplusg 17211 Scalarcsca 17214 ·𝑠 cvsca 17215 0gc0g 17393 LModclmod 20846 LSubSpclss 20917 |
| 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 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-mgp 20113 df-ur 20154 df-ring 20207 df-lmod 20848 df-lss 20918 |
| This theorem is referenced by: lssvnegcl 20942 islss3 20945 islss4 20948 ellspsni 20987 lspsn 20988 lmhmima 21034 lmhmpreima 21035 reslmhm 21039 lsmcl 21070 pj1lmhm 21087 lssvs0or 21100 lspfixed 21118 lspexch 21119 lspsolv 21133 frlmssuvc1 21784 frlmsslsp 21786 mplbas2 22030 lssnlm 24676 minveclem2 25403 pjthlem1 25414 eqgvscpbl 33425 lindsunlem 33784 algextdeglem8 33884 lshpkrlem5 39574 ldualssvscl 39618 dochkr1 41938 dochkr1OLDN 41939 lclkrlem2o 41981 lcfrlem5 42006 lcdlssvscl 42066 hgmapvvlem3 42385 gsumlsscl 48868 |
| Copyright terms: Public domain | W3C validator |