reserve n,m,k for Nat,
  x,X for set,
  A for Subset of X,
  A1,A2 for SetSequence of X;

theorem Th30:
  A1 is non-ascending implies A1 (\) A is non-ascending
proof
  assume
A1: A1 is non-ascending;
  for n,m st n <= m holds (A1 (\) A).m c= (A1 (\) A).n
  proof
    let n,m;
    assume n <= m;
    then A1.m c= A1.n by A1,PROB_1:def 4;
    then A1.m \ A c= A1.n \ A by XBOOLE_1:33;
    then (A1 (\) A).m c= A1.n \ A by Def8;
    hence thesis by Def8;
  end;
  hence thesis by PROB_1:def 4;
end;
