theorem Th49: :: GLIBPRE1:48

for G1, G2 being _Graph
for W1 being Walk of G1
for W2 being Walk of G2 st G1 == G2 & W1 = W2 & W1 is minlength holds
W2 is minlength