
theorem Th96:
  for G1, G2 being _Graph, F being non empty one-to-one PGraphMapping of G1, G2
  for W2 being F-valued Walk of G2
  holds (F"W2).edges() = F_E"W2.edges()
proof
  let G1, G2 be _Graph, F be non empty one-to-one PGraphMapping of G1, G2;
  let W2 be F-valued Walk of G2;
  thus (F"W2).edges() = (F"_E).:W2.edges() by GLIB_010:136
    .= F_E"W2.edges() by FUNCT_1:85;
end;
