
theorem Th106:
  for F being non empty Graph-yielding Function, z being Element of dom F
  holds canGFDistinction(F),canGFDistinction(F,z) are_Disomorphic
proof
  let F be non empty Graph-yielding Function, z be Element of dom F;
  A1: canGFDistinction F, F are_Disomorphic by Th87;
  F, canGFDistinction(F,z) are_Disomorphic by Th105;
  hence thesis by A1, Th40;
end;
