reserve p,q,x,x1,x2,y,y1,y2,z,z1,z2 for set;
reserve A,B,V,X,X1,X2,Y,Y1,Y2,Z for set;
reserve C,C1,C2,D,D1,D2 for non empty set;

theorem Th2:
  for f,g being Function st X c= dom(g*f) holds f.:X c= dom g
proof
  let f,g be Function such that
A1: X c= dom(g*f);
  let y be object;
  assume y in f.:X;
  then ex x being object st x in dom f & x in X & y = f.x by FUNCT_1:def 6;
  hence thesis by A1,FUNCT_1:11;
end;
