let n be Element of NAT ; :: thesis: for X being set
for B being SetSequence of X st B is non-ascending holds
(inferior_setsequence B) . n = Intersection B
let X be set ; :: thesis: for B being SetSequence of X st B is non-ascending holds
(inferior_setsequence B) . n = Intersection B
let B be SetSequence of X; :: thesis: ( B is non-ascending implies (inferior_setsequence B) . n = Intersection B )
defpred S₁[ Nat] means (inferior_setsequence B) . $1 = Intersection B;
assume B is non-ascending ; :: thesis: (inferior_setsequence B) . n = Intersection B
then A1: for k being Element of NAT st S₁[k] holds
S₁[k + 1] by Th51;
A2: S₁[ 0 ] by Th17;
for k being Element of NAT holds S₁[k] from NAT_1:sch 1(A2, A1);
hence (inferior_setsequence B) . n = Intersection B ; :: thesis: verum