theorem
  for R being Relation, P being RedSequence of R st len P > 1 holds
  ex Q being RedSequence of R st
  len Q + 1 = len P & for k st k in dom Q holds Q.k = P.(k + 1)
proof
  let R be Relation, P be RedSequence of R;
  assume len P > 1;
  then consider Q being RedSequence of R such that
A1: P = <*P.1*>^Q & len Q + 1 = len P by Th5;
  take Q;
  thus thesis by A1,FINSEQ_3:103;
end;
