let f be FinSequence of (TOP-REAL 2); :: thesis: for i being Element of NAT holds L~ (f | i) c= L~ f
let i be Element of NAT ; :: thesis: L~ (f | i) c= L~ f
set h = f | i;
set Mh = { (LSeg (f | i),n) where n is Element of NAT : ( 1 <= n & n + 1 <= len (f | i) ) } ;
set Mf = { (LSeg f,m) where m is Element of NAT : ( 1 <= m & m + 1 <= len f ) } ;
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in L~ (f | i) or x in L~ f )
A1: f | i = f | (Seg i) by FINSEQ_1:def 15;
A2: dom f = Seg (len f) by FINSEQ_1:def 3;
assume A3: x in L~ (f | i) ; :: thesis: x in L~ f
then consider X being set such that
A4: x in X and
A5: X in { (LSeg (f | i),n) where n is Element of NAT : ( 1 <= n & n + 1 <= len (f | i) ) } by TARSKI:def 4;
consider k being Element of NAT such that
A6: X = LSeg (f | i),k and
A7: 1 <= k and
A8: k + 1 <= len (f | i) by A5;

per cases ( i in dom f or not i in dom f ) ;

suppose A9: i in dom f ; :: thesis: x in L~ f

A10: dom (f | i) = (dom f) /\ (Seg i) by A1, RELAT_1:90;
A11: i <= len f by A9, FINSEQ_3:27;
then Seg i c= dom f by A2, FINSEQ_1:7;
then dom (f | i) = Seg i by A10, XBOOLE_1:28;
then len (f | i) <= len f by A11, FINSEQ_1:def 3;
then A12: k + 1 <= len f by A8, XXREAL_0:2;
k <= k + 1 by NAT_1:12;
then k <= len (f | i) by A8, XXREAL_0:2;
then A13: k in dom (f | i) by A7, FINSEQ_3:27;
1 <= k + 1 by NAT_1:12;
then k + 1 in dom (f | i) by A8, FINSEQ_3:27;
then X = LSeg f,k by A6, A13, Th24;
then X in { (LSeg f,m) where m is Element of NAT : ( 1 <= m & m + 1 <= len f ) } by A7, A12;
hence x in L~ f by A4, TARSKI:def 4; :: thesis: verum

end;

suppose A14: not i in dom f ; :: thesis: x in L~ f

now

per cases ( i < 1 or len f < i ) by A14, FINSEQ_3:27;

case i < 1 ; :: thesis: contradiction

then i < 0 + 1 ;
then i <= 0 by NAT_1:13;
then Seg i = {} by FINSEQ_1:4;
then dom (f | i) = (dom f) /\ {} by A1, RELAT_1:90;
then dom (f | i) = {} ;
then Seg (len (f | i)) = {} by FINSEQ_1:def 3;
then len (f | i) = 0 by FINSEQ_1:4, FINSEQ_1:def 3;
hence contradiction by A3, TOPREAL1:28; :: thesis: verum

end;

case len f < i ; :: thesis: x in L~ f

then Seg (len f) c= Seg i by FINSEQ_1:7;
then dom f c= Seg i by FINSEQ_1:def 3;
then A15: dom f = (dom f) /\ (Seg i) by XBOOLE_1:28;
for x being set st x in dom (f | i) holds
(f | i) . x = f . x by A1, FUNCT_1:70;
then f | i = f by A1, A15, FUNCT_1:9, RELAT_1:90;
hence x in L~ f by A4, A5, TARSKI:def 4; :: thesis: verum

end;

end;

end;

hence x in L~ f ; :: thesis: verum

end;

end;