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

theorem Th5:
  for V being non empty Subset of the_Vertices_of G
  for H being inducedSubgraph of G, V, {}
  holds H == createGraph(V)
proof
  let V be non empty Subset of the_Vertices_of G;
  let H be inducedSubgraph of G, V, {};
  {} c= G.edgesBetween(V) by XBOOLE_1:2;
  then the_Vertices_of H = the_Vertices_of createGraph(V) &
    the_Edges_of H = the_Edges_of createGraph(V) by GLIB_000:def 37;
  hence thesis by GLIB_000:86;
end;
