
theorem Th96:
  for F being non empty Graph-yielding Function, z being Element of dom F
  holds canGFDistinction(F,z).z = F.z | _GraphSelectors
proof
  let F be non empty Graph-yielding Function, z be Element of dom F;
  dom F = dom canGFDistinction F by Def25;
  hence canGFDistinction(F,z).z = F.z | _GraphSelectors by FUNCT_7:31;
end;
