
theorem Th2:
  for X being set, F being BinOp of X,
      A being F-binopclosed Subset of X holds
    F || A is BinOp of A
proof
  let X be set, F be BinOp of X, A be F-binopclosed Subset of X;
  dom F = [:X,X:] by PARTFUN1:def 2; then
A1: dom (F||A) = [:A,A:] by RELAT_1:62,ZFMISC_1:96;
  for x being object holds x in [:A,A:] implies F||A.x in A
  proof
    let x be object;
    assume
A2: x in [:A,A:];
    then F||A.x=F.x by A1,FUNCT_1:47;
    hence thesis by A2,Def1;
  end;
  hence thesis by A1,FUNCT_2:3;
end;
