theorem :: GLIB_001:106

for G being _Graph
for W being Walk of G
for n, m being Element of NAT holds (W .cut (m,n)) .edges() c= W .edges()