reserve G, G1, G2 for _Graph, H for Subgraph of G;

theorem Th6:
  for H being removeEdges of G, the_Edges_of G
  holds H == createGraph([#]the_Vertices_of G)
proof
  let H be removeEdges of G, the_Edges_of G;
  the_Edges_of G \ the_Edges_of G = {} &
    [#]the_Vertices_of G = the_Vertices_of G by XBOOLE_1:37;
  hence thesis by Th5;
end;
