reserve f,g,h for Function,
  A for set;
reserve F for Function,
  B,x,y,y1,y2,z for set;
reserve x,z for object;
reserve X for non empty set,
  Y for set,
  F for BinOp of X,
  f,g,h for Function of Y,X,
  x,x1,x2 for Element of X;
reserve Y for non empty set,
  F for BinOp of X,
  f,g,h for Function of Y,X,
  x,x1,x2 for Element of X;

theorem
  for g being Function of X,X holds F.:(g, id X).x = F.(g.x,x)
proof
  let g be Function of X,X;
  thus F.:(g, id X).x = F.(g.x, id X.x) by Th37
    .= F.(g.x, x);
end;
