
theorem Th28:
  for G being _finite _Graph holds LexBFS:CSeq(G) is iterative
proof
  let G be _finite _Graph;
  set CS = LexBFS:CSeq(G);
  let k,n be Nat such that
A1: CS.k = CS.n;
  CS.(k+1) = LexBFS:Step(CS.k) by Def16;
  hence CS.(k+1) = CS.(n+1) by A1,Def16;
end;
