theorem Th64: :: GLIB_007:64

for G2 being _Graph
for v being object
for V being set
for G1 being addAdjVertexAll of G2,v,V
for W being Walk of G1 st V c= the_Vertices_of G2 & not v in the_Vertices_of G2 & ( ( W .edges() c= the_Edges_of G2 & not W is trivial ) or not v in W .vertices() ) holds
W is Walk of G2