reserve x,y for object,X for set,
  f for Function,
  R,S for Relation;

theorem Th11:
  f is integer-valued iff for x holds f.x is integer
proof
  hereby
    assume
A1: f is integer-valued;
    let x;
    per cases;
    suppose
      x in dom f;
      hence f.x is integer by A1;
    end;
    suppose
      not x in dom f;
      hence f.x is integer by FUNCT_1:def 2;
    end;
  end;
  thus thesis;
end;
