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;
reserve 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;
reserve 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;
reserve 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 Element of Y;

theorem
  F is associative implies F.:(F[:](f,x),g) = F.:(f,F[;](x,g))
proof
  assume
A1: F is associative;
  per cases;
  suppose
    Y = {};
    hence thesis;
  end;
  suppose
A2: Y <> {};
    now
      let y;
      reconsider x1 = f.y, x2 = g.y as Element of X by A2,FUNCT_2:5;
      thus (F.:(F[:](f,x),g)).y = F.((F[:](f,x)).y,g.y) by A2,Th37
        .= F.(F.(x1,x),x2) by A2,Th48
        .= F.(x1,F.(x,x2)) by A1
        .= F.(f.y,(F[;](x,g)).y) by A2,Th53;
    end;
    hence thesis by A2,Th38;
  end;
end;
