theorem :: GLIB_002:42

for G being acyclic _Graph
for W being Path of G
for e being set st not e in W .edges() & e in (W .last()) .edgesInOut() holds
W .addEdge e is Path-like by Lm22;