reserve X,X1,X2,Y,Y1,Y2 for set, p,x,x1,x2,y,y1,y2,z,z1,z2 for object;
reserve f,g,g1,g2,h for Function,
  R,S for Relation;

theorem
  (Y|`f).:X c= f.:X
proof
  let y be object;
  assume y in (Y|`f).:X;
  then consider x being object such that
A1: x in dom(Y|`f) and
A2: x in X and
A3: y = (Y|`f).x by Def6;
  y = f.x & x in dom f by A1,A3,Th52;
  hence thesis by A2,Def6;
end;
