
theorem Th35:
  for G being _finite _Graph holds LexBFS:CSeq(G) is eventually-constant
proof
  let G be _finite _Graph;
  take G.order();
  let m be Nat;
  assume G.order() <= m;
  hence (LexBFS:CSeq(G)).(G.order()) = (LexBFS:CSeq(G)).m by Th33;
end;
