reserve G for _Graph;
reserve V for non empty set, E for Relation of V;

theorem
  for G being non-Dmulti _Graph
  holds createGraph(the_Vertices_of G,VertexDomRel(G)) is G-Disomorphic
proof
  let G be non-Dmulti _Graph;
  set G9 = createGraph(the_Vertices_of G,VertexDomRel(G));
  consider F being PGraphMapping of G, G9 such that
    A1: F is Disomorphism and F_V = id the_Vertices_of G &
      for e being object st e in the_Edges_of G
      holds F_E.e = [(the_Source_of G).e,(the_Target_of G).e] by Th86;
  thus thesis by A1, GLIB_010:def 24;
end;
