let X be set ; :: thesis: for B being SetSequence of X st B is non-descending holds
Intersection (superior_setsequence B) = Union B

let B be SetSequence of X; :: thesis: ( B is non-descending implies Intersection (superior_setsequence B) = Union B )
assume A1: B is non-descending ; :: thesis: Intersection (superior_setsequence B) = Union B
now :: thesis: for x being object st x in Intersection (superior_setsequence B) holds
x in Union B
end;
then A3: Intersection (superior_setsequence B) c= Union B ;
now :: thesis: for y being object st y in Union B holds
y in Intersection (superior_setsequence B)
end;
then Union B c= Intersection (superior_setsequence B) ;
hence Intersection (superior_setsequence B) = Union B by A3, XBOOLE_0:def 10; :: thesis: verum