set E = the RepEdgeSelection of G;
set G2 = the inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops());
take the inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops()) ; :: thesis: ex E being RepEdgeSelection of G st the inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops()) is inducedSubgraph of G, the_Vertices_of G,E \ (G .loops())
take the RepEdgeSelection of G ; :: thesis: the inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops()) is inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops())
thus the inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops()) is inducedSubgraph of G, the_Vertices_of G, the RepEdgeSelection of G \ (G .loops()) ; :: thesis: verum