Theorem lspssv

Description: A span is a set of vectors. (Contributed by NM, 22-Feb-2014) (Revised by Mario Carneiro, 19-Jun-2014)

	Ref	Expression
Hypotheses	lspss.v	⊢ 𝑉 = ( Base ‘ 𝑊 )
	lspss.n	⊢ 𝑁 = ( LSpan ‘ 𝑊 )
Assertion	lspssv	⊢ ( ( 𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉 ) → ( 𝑁 ‘ 𝑈 ) ⊆ 𝑉 )

Proof

Step	Hyp	Ref	Expression
1		lspss.v	⊢ 𝑉 = ( Base ‘ 𝑊 )
2		lspss.n	⊢ 𝑁 = ( LSpan ‘ 𝑊 )
3		eqid	⊢ ( LSubSp ‘ 𝑊 ) = ( LSubSp ‘ 𝑊 )
4	1 3 2	lspcl	⊢ ( ( 𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉 ) → ( 𝑁 ‘ 𝑈 ) ∈ ( LSubSp ‘ 𝑊 ) )
5	1 3	lssss	⊢ ( ( 𝑁 ‘ 𝑈 ) ∈ ( LSubSp ‘ 𝑊 ) → ( 𝑁 ‘ 𝑈 ) ⊆ 𝑉 )
6	4 5	syl	⊢ ( ( 𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉 ) → ( 𝑁 ‘ 𝑈 ) ⊆ 𝑉 )