theorem Th46: :: GLIB_001:48

for G1, G2 being _Graph
for W1 being Walk of G1
for W2 being Walk of G2
for m, n being Element of NAT st W1 = W2 holds
W1 .cut (m,n) = W2 .cut (m,n)