Step
*
of Lemma
vs-bag-add-mul
∀[K:Rng]. ∀[vs:VectorSpace(K)]. ∀[S:Type]. ∀[f:S ⟶ Point(vs)]. ∀[bs:bag(S)]. ∀[k:|K|].
(k * Σ{f[b] | b ∈ bs} = Σ{k * f[b] | b ∈ bs} ∈ Point(vs))
BY
{ (Auto THEN DVar `bs') }
1
1. K : Rng
2. vs : VectorSpace(K)
3. S : Type
4. f : S ⟶ Point(vs)
5. bs : Base
6. b1 : Base
7. bs = b1 ∈ pertype(λas,bs. ((as ∈ S List) ∧ (bs ∈ S List) ∧ permutation(S;as;bs)))
8. bs ∈ S List
9. b1 ∈ S List
10. permutation(S;bs;b1)
11. k : |K|
⊢ k * Σ{f[b] | b ∈ bs} = Σ{k * f[b] | b ∈ b1} ∈ Point(vs)
Latex:
Latex:
\mforall{}[K:Rng]. \mforall{}[vs:VectorSpace(K)]. \mforall{}[S:Type]. \mforall{}[f:S {}\mrightarrow{} Point(vs)]. \mforall{}[bs:bag(S)]. \mforall{}[k:|K|].
(k * \mSigma{}\{f[b] | b \mmember{} bs\} = \mSigma{}\{k * f[b] | b \mmember{} bs\})
By
Latex:
(Auto THEN DVar `bs')
Home
Index