theorem Th51:
 for n being Nat holds
  B is non-ascending implies (inferior_setsequence(B)).n = (
  inferior_setsequence(B)).(n+1)
proof let n be Nat;
  assume B is non-ascending;
  then
  (inferior_setsequence(B)).(n+1) /\ B.n = (inferior_setsequence(B)).(n+1)
  by Th50,XBOOLE_1:28;
  hence thesis by Th21;
end;
