
theorem Th17:
  for G being _Graph
  for V being non empty one-to-one ManySortedSet of the_Vertices_of G
  for E being one-to-one ManySortedSet of the_Edges_of G
  holds replaceVerticesEdges(V,E) is G-Disomorphic
proof
  let G be _Graph;
  let V be non empty one-to-one ManySortedSet of the_Vertices_of G;
  let E be one-to-one ManySortedSet of the_Edges_of G;
  consider F being PGraphMapping of G, replaceVerticesEdges(V,E) such that
    A1: F_V = V & F_E = E & F is Disomorphism by Th16;
  thus thesis by A1, GLIB_010:def 24;
end;
