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 Th65:
  1 <= len W.vertexSeq()
proof
  now
    assume len W.vertexSeq() < 1;
    then len W.vertexSeq() < 0 + 1;
    then len W.vertexSeq() = 0 by NAT_1:13;
    then len W + 1 = 2 * 0 by Def14;
    hence contradiction;
  end;
  hence thesis;
end;
