theorem
  f is one-to-one implies (d in rng f & c = (f").d iff c in dom f & d = f.c)
proof
A1: f" = (f qua Function)";
  assume f is one-to-one;
  hence thesis by A1,FUNCT_1:32;
end;
