
theorem Th87:
  for F being non empty Graph-yielding Function
  holds F,canGFDistinction(F) are_Disomorphic
proof
  let F be non empty Graph-yielding Function;
  A1: dom F = dom canGFDistinction F by Def25;
  for x being Element of dom F, x9 being Element of dom canGFDistinction F
    st x = x9 holds (canGFDistinction F).x9 is F.x-Disomorphic by Th86;
  hence thesis by A1, Th38;
end;
