
theorem Th37:
  for P being _finite non _trivial Path-like _Graph
  holds card Endvertices P = 2
proof
  let P be _finite non _trivial Path-like _Graph;
  consider v1,v2 being Vertex of P such that
    A1: v1 <> v2 & Endvertices P = {v1,v2} by Th36;
  thus thesis by A1, CARD_2:57;
end;
