let X be set ; :: thesis: for A being Subset of X
for A1 being SetSequence of X st A1 is non-descending holds
A1 (\) A is non-descending
let A be Subset of X; :: thesis: for A1 being SetSequence of X st A1 is non-descending holds
A1 (\) A is non-descending
let A1 be SetSequence of X; :: thesis: ( A1 is non-descending implies A1 (\) A is non-descending )
assume A1: A1 is non-descending ; :: thesis: A1 (\) A is non-descending
for n, m being Nat st n <= m holds
(A1 (\) A) . n c= (A1 (\) A) . m

proof

let n, m be Nat; :: thesis: ( n <= m implies (A1 (\) A) . n c= (A1 (\) A) . m )
assume n <= m ; :: thesis: (A1 (\) A) . n c= (A1 (\) A) . m
then A1 . n c= A1 . m by A1, PROB_1:def 5;
then (A1 . n) \ A c= (A1 . m) \ A by XBOOLE_1:33;
then (A1 (\) A) . n c= (A1 . m) \ A by Def8;
hence (A1 (\) A) . n c= (A1 (\) A) . m by Def8; :: thesis: verum

end;

hence A1 (\) A is non-descending by PROB_1:def 5; :: thesis: verum