theorem :: GLIB_001:43

for G being _Graph
for W being Walk of G
for n, m being Element of NAT st m is odd & m <= n holds
(W .cut (1,n)) .cut (1,m) = W .cut (1,m) by Lm20;