reserve G for Graph,
  k, m, n for Nat;
reserve G for non void Graph;

theorem Th5:
  for G being Graph, c being Chain of G, vs being FinSequence of
the carrier of G st c is cyclic & vs is_vertex_seq_of c
 holds vs.1 = vs.(len vs) by Lm1;
