theorem Th150: :: GLIB_006:146

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