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

theorem Th47:
  G | _GraphSelectors in G.allInducedSG()
proof
  the_Vertices_of G c= the_Vertices_of G;
  then A1: the_Vertices_of G is non empty Subset of the_Vertices_of G;
  G is inducedSubgraph of G, the_Vertices_of G by GLIB_000:100;
  hence thesis by A1, Th46;
end;
