
theorem Th40:
  for G being _finite _Graph holds (LexBFS:CSeq(G))``1.Result() = (
  LexBFS:CSeq(G)).Result()`1
proof
  let G be _finite _Graph;
  set S = LexBFS:CSeq(G);
  thus S``1.Result() = S``1.(S.Lifespan()) by Th39
    .= S.Result()`1 by Def15;
end;
