theorem Th149: :: GLIB_006:145

for G2 being _Graph
for v1 being Vertex of G2
for e, v2 being object
for G1 being addAdjVertex of G2,v1,e,v2
for W being Walk of G1 st not e in the_Edges_of G2 & not v2 in the_Vertices_of G2 & ( ( not e in W .edges() & W is trivial ) or not v2 in W .vertices() ) holds
W is Walk of G2