Theorem clmvscl 25416

Description: Closure of scalar product for a subcomplex module. Analogue of lmodvscl 21160. (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 25395	. 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 21160	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑄 · 𝑋) ∈ 𝑉)
7	1, 6	syl3an1 1181	1 ⊢ ((𝑊 ∈ ℂMod ∧ 𝑄 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝑄 · 𝑋) ∈ 𝑉)

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ‘cfv 6541  (class class class)co 7422  Basecbs 17394  Scalarcsca 17438   ·_𝑠 cvsca 17439  LModclmod 21142  ℂModcclm 25390

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6496  df-fv 6549  df-ov 7425  df-lmod 21144  df-clm 25391

This theorem is used by:  clmpm1dir  25431  clmnegsubdi2  25433  clmsub4  25434  clmvsubval2  25438  clmvz  25439  nmoleub2lem3  25443  nmoleub3  25447  ncvspi  25484