let GF be non empty right_complementable well-unital distributive Abelian add-associative right_zeroed associative doubleLoopStr ; :: thesis: for V being non empty right_complementable vector-distributive scalar-distributive scalar-associative scalar-unital Abelian add-associative right_zeroed ModuleStr over GF
for L being Linear_Combination of V holds (1. GF) * L = L
let V be non empty right_complementable vector-distributive scalar-distributive scalar-associative scalar-unital Abelian add-associative right_zeroed ModuleStr over GF; :: thesis: for L being Linear_Combination of V holds (1. GF) * L = L
let L be Linear_Combination of V; :: thesis: (1. GF) * L = L
let v be Element of V; :: according to VECTSP_6:def 7 :: thesis: ((1. GF) * L) . v = L . v
thus ((1. GF) * L) . v = (1. GF) * (L . v) by Def9
.= L . v ; :: thesis: verum