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