let K be non empty addLoopStr ; :: thesis: for V, W being non empty ModuleStr over K
for f, g being Form of V,W
for v being Vector of V holds FunctionalFAF ((f - g),v) = (FunctionalFAF (f,v)) - (FunctionalFAF (g,v))
let V, W be non empty ModuleStr over K; :: thesis: for f, g being Form of V,W
for v being Vector of V holds FunctionalFAF ((f - g),v) = (FunctionalFAF (f,v)) - (FunctionalFAF (g,v))
let f, g be Form of V,W; :: thesis: for v being Vector of V holds FunctionalFAF ((f - g),v) = (FunctionalFAF (f,v)) - (FunctionalFAF (g,v))
let w be Vector of V; :: thesis: FunctionalFAF ((f - g),w) = (FunctionalFAF (f,w)) - (FunctionalFAF (g,w))

now :: thesis: for v being Vector of W holds (FunctionalFAF ((f - g),w)) . v = ((FunctionalFAF (f,w)) - (FunctionalFAF (g,w))) . v

let v be Vector of W; :: thesis: (FunctionalFAF ((f - g),w)) . v = ((FunctionalFAF (f,w)) - (FunctionalFAF (g,w))) . v
thus (FunctionalFAF ((f - g),w)) . v = (f - g) . (w,v) by Th8
.= (f . (w,v)) - (g . (w,v)) by Def7
.= ((FunctionalFAF (f,w)) . v) - (g . (w,v)) by Th8
.= ((FunctionalFAF (f,w)) . v) - ((FunctionalFAF (g,w)) . v) by Th8
.= ((FunctionalFAF (f,w)) . v) + (- ((FunctionalFAF (g,w)) . v)) by RLVECT_1:def 11
.= ((FunctionalFAF (f,w)) . v) + ((- (FunctionalFAF (g,w))) . v) by HAHNBAN1:def 4
.= ((FunctionalFAF (f,w)) - (FunctionalFAF (g,w))) . v by HAHNBAN1:def 3 ; :: thesis: verum

end;

hence FunctionalFAF ((f - g),w) = (FunctionalFAF (f,w)) - (FunctionalFAF (g,w)) by FUNCT_2:63; :: thesis: verum