
theorem
  for G being plain _Graph holds G = createGraph(the_Vertices_of G,
    the_Edges_of G, the_Source_of G, the_Target_of G)
proof
  let G be plain _Graph;
  set H = createGraph(the_Vertices_of G, the_Edges_of G,
    the_Source_of G, the_Target_of G);
  the_Vertices_of G = the_Vertices_of H &
    the_Edges_of G = the_Edges_of H &
    the_Source_of G = the_Source_of H &
    the_Target_of G = the_Target_of H;
  hence thesis by GLIB_000:def 34, GLIB_009:44;
end;
