
theorem Th95:
  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).vertices() = F_V"W2.vertices()
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).vertices() = (F"_V).:W2.vertices() by GLIB_010:135
    .= F_V"W2.vertices() by FUNCT_1:85;
end;
