let T be non empty RelStr ; :: thesis: for A being Subset of T st T is filled holds
for n being Element of NAT holds Fint (A,n) c= A
let A be Subset of T; :: thesis: ( T is filled implies for n being Element of NAT holds Fint (A,n) c= A )
defpred S₁[ Element of NAT ] means (Fint A) . $1 c= A;
assume A1: T is filled ; :: thesis: for n being Element of NAT holds Fint (A,n) c= A
A2: for k being Element of NAT st S₁[k] holds
S₁[k + 1]

proof

let k be Element of NAT ; :: thesis: ( S₁[k] implies S₁[k + 1] )
assume S₁[k] ; :: thesis: S₁[k + 1]
then (Fint (A,k)) ^i c= A ^i by FINTOPO2:1;
then A3: Fint (A,(k + 1)) c= A ^i by Def4;
A ^i c= A by A1, FIN_TOPO:22;
hence S₁[k + 1] by A3, XBOOLE_1:1; :: thesis: verum

end;

let n be Element of NAT ; :: thesis: Fint (A,n) c= A
A4: S₁[ 0 ] by Def4;
for n being Element of NAT holds S₁[n] from NAT_1:sch 1(A4, A2);
hence Fint (A,n) c= A ; :: thesis: verum