
theorem
  for G being _Graph, X being set, E being Subset of the_Edges_of G
  for H being reverseEdgeDirections of G, X
  holds E is RepEdgeSelection of G iff E is RepEdgeSelection of H
proof
  let G be _Graph, X be set, E be Subset of the_Edges_of G;
  let H be reverseEdgeDirections of G, X;
  thus E is RepEdgeSelection of G implies E is RepEdgeSelection of H by Lm3;
  A1: G is reverseEdgeDirections of H, X by GLIB_007:3;
  assume E is RepEdgeSelection of H;
  hence thesis by A1, Lm3;
end;
