
theorem sa:
for X being non empty set
for L being associative non empty multLoopStr
for a,b being Element of L
for f being Function of X,L holds (a * b) '*' f = a '*' (b '*' f)
proof
let X be non empty set, L be non empty associative multLoopStr,
    a,b be Element of L, f be Function of X,L;
now let o be object;
  assume o in X;
  then reconsider x = o as Element of X;
  thus ((a * b) '*' f).o
     = (a * b) * (f.x) by defmu
    .= a * (b * f.x) by GROUP_1:def 3
    .= a * (b '*' f).x by defmu
    .= (a '*' (b '*' f)).o by defmu;
  end;
hence thesis by FUNCT_2:12;
end;
