reserve x,y,y1,y2,z,a,b for object, X,Y,Z,V1,V2 for set,
  f,g,h,h9,f1,f2 for Function,
  i for Nat,
  P for Permutation of X,
  D,D1,D2,D3 for non empty set,
  d1 for Element of D1,
  d2 for Element of D2,
  d3 for Element of D3;

theorem Th7:
  x in dom f & g = f.x implies rng g c= rng uncurry f & rng g c= rng uncurry' f
proof
  assume
A1: x in dom f & g = f.x;
  thus rng g c= rng uncurry f
  proof
    let y be object;
    assume y in rng g;
    then ex z being object st z in dom g & y = g.z by FUNCT_1:def 3;
    hence thesis by A1,FUNCT_5:38;
  end;
  let y be object;
  assume y in rng g;
  then ex z being object st z in dom g & y = g.z by FUNCT_1:def 3;
  hence thesis by A1,FUNCT_5:39;
end;
