
theorem Th94:
  for F being non empty Graph-yielding Function, z being Element of dom F
  holds dom F = dom canGFDistinction(F,z)
proof
  let F be non empty Graph-yielding Function, z be Element of dom F;
  thus dom F = dom canGFDistinction F by Def25
    .= dom canGFDistinction(F,z) by FUNCT_7:30;
end;
