
theorem Th116:
  for F being non empty Graph-yielding Function, S being GraphSum of F
  for G9 being GraphUnion of rng canGFDistinction(F)
  holds S is G9-Disomorphic
proof
  let F be non empty Graph-yielding Function, S be GraphSum of F;
  let G9 be GraphUnion of rng canGFDistinction(F);
  consider G8 being GraphUnion of rng canGFDistinction(F) such that
    A1: S is G8-Disomorphic by Def27;
  G8 is G9-Disomorphic by GLIB_014:22, GLIBPRE0:76;
  hence thesis by A1;
end;
