Theorem clmvscl 25278

Description: Closure of scalar product for a subcomplex module. Analogue of lmodvscl 21029. (Contributed by NM, 3-Nov-2006.) (Revised by AV, 28-Sep-2021.)

Hypotheses

Ref	Expression
clmvscl.v	⊢ 𝑉 = (Base‘𝑊)
clmvscl.f	⊢ 𝐹 = (Scalar‘𝑊)
clmvscl.s	⊢ · = ( ·𝑠 ‘𝑊)
clmvscl.k	⊢ 𝐾 = (Base‘𝐹)

Assertion

Ref	Expression
clmvscl	⊢ ((𝑊 ∈ ℂMod ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑄 · 𝑋) ∈ 𝑉)

Proof of Theorem clmvscl

Step	Hyp	Ref	Expression
1		clmlmod 25257	. 2 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ LMod)
2		clmvscl.v	. . 3 ⊢ 𝑉 = (Base‘𝑊)
3		clmvscl.f	. . 3 ⊢ 𝐹 = (Scalar‘𝑊)
4		clmvscl.s	. . 3 ⊢ · = ( ·𝑠 ‘𝑊)
5		clmvscl.k	. . 3 ⊢ 𝐾 = (Base‘𝐹)
6	2, 3, 4, 5	lmodvscl 21029	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑄 · 𝑋) ∈ 𝑉)
7	1, 6	syl3an1 1181	1 ⊢ ((𝑊 ∈ ℂMod ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑄 · 𝑋) ∈ 𝑉)

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ‘cfv 6540  (class class class)co 7416  Basecbs 17287  Scalarcsca 17331   ·_𝑠 cvsca 17332  LModclmod 21011  ℂModcclm 25252

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-ext 2737  ax-nul 5271

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-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7419  df-lmod 21013  df-clm 25253

This theorem is used by:  clmpm1dir  25293  clmnegsubdi2  25295  clmsub4  25296  clmvsubval2  25300  clmvz  25301  nmoleub2lem3  25305  nmoleub3  25309  ncvspi  25346