theorem Th5: :: GRAPH_3:5

for G being Graph
for p being Path of G
for n, m being Nat holds (m,n) -cut p is Path of G