theorem
  for F be ManySortedFunction of A, B for X be ManySortedSubset of A
  holds rngs (F || X) c= rngs F
proof
  let F be ManySortedFunction of A, B, X be ManySortedSubset of A;
  let i be object;
A1: dom (F||X) = I by PARTFUN1:def 2;
  assume
A2: i in I;
  then reconsider f = F.i as Function of A.i, B.i by PBOOLE:def 15;
  dom F = I by PARTFUN1:def 2;
  then
A3: (rngs F).i = rng f by A2,FUNCT_6:22;
  (F||X).i = f|(X.i) by A2,MSAFREE:def 1;
  then (rngs (F||X)).i = rng (f|(X.i)) by A2,A1,FUNCT_6:22;
  hence thesis by A3,RELAT_1:70;
end;
