reserve G,G1,G2 for _Graph;
reserve W,W1,W2 for Walk of G;
reserve e,x,y,z for set;
reserve v for Vertex of G;
reserve n,m for Element of NAT;

theorem
  for W being Path of G, m, n being Element of NAT holds W.cut(m,n) is
  Path-like;
