| 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 20900 | . . . . 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 20841 | . . . 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 20856 | . . 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 20910 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (0g‘𝑊) ∈ 𝑈) |
| 19 | 18 | adantr 480 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈)) → (0g‘𝑊) ∈ 𝑈) |
| 20 | 7, 9, 12, 8, 4 | lsscl 20905 | . . 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 6500 (class class class)co 7368 Basecbs 17148 +gcplusg 17189 Scalarcsca 17192 ·𝑠 cvsca 17193 0gc0g 17371 LModclmod 20823 LSubSpclss 20894 |
| 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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-sbg 18880 df-mgp 20088 df-ur 20129 df-ring 20182 df-lmod 20825 df-lss 20895 |
| This theorem is referenced by: lssvnegcl 20919 islss3 20922 islss4 20925 ellspsni 20964 lspsn 20965 lmhmima 21011 lmhmpreima 21012 reslmhm 21016 lsmcl 21047 pj1lmhm 21064 lssvs0or 21077 lspfixed 21095 lspexch 21096 lspsolv 21110 frlmssuvc1 21761 frlmsslsp 21763 mplbas2 22009 lssnlm 24657 minveclem2 25394 pjthlem1 25405 eqgvscpbl 33442 lindsunlem 33801 algextdeglem8 33901 lshpkrlem5 39487 ldualssvscl 39531 dochkr1 41851 dochkr1OLDN 41852 lclkrlem2o 41894 lcfrlem5 41919 lcdlssvscl 41979 hgmapvvlem3 42298 gsumlsscl 48737 |
| Copyright terms: Public domain | W3C validator |