let G1 be _Graph; :: thesis: for G2 being Subgraph of G1 holds G2 is inducedSubgraph of G1, the_Vertices_of G2, the_Edges_of G2
let G2 be Subgraph of G1; :: thesis: G2 is inducedSubgraph of G1, the_Vertices_of G2, the_Edges_of G2
the_Edges_of G2 = G2 .edgesBetween (the_Vertices_of G2) by Th34;
then the_Edges_of G2 c= G1 .edgesBetween (the_Vertices_of G2) by Th76;
hence G2 is inducedSubgraph of G1, the_Vertices_of G2, the_Edges_of G2 by Def37; :: thesis: verum