theorem
  for R being Relation, P being RedSequence of R st len P > 1 holds ex Q
  being RedSequence of R st Q^<*P.len P*> = P & len Q + 1 = len P
proof
  let R be Relation, P be RedSequence of R such that
A1: len P > 1;
  consider Q being FinSequence, x such that
A2: P = Q^<*x*> and
A3: len Q + 1 = len P by Th2;
  1 + len Q > 1 + 0 by A1,A3;
  then len <*x*> = 1 & len Q > 0 by FINSEQ_1:39;
  then
A4: Q is RedSequence of R by A2,Th4;
  P.len P = x by A2,A3,FINSEQ_1:42;
  hence thesis by A2,A3,A4;
end;
