let X be ComplexNormSpace; :: thesis: for seq, seq1 being sequence of X st seq1 is subsequence of seq & seq is convergent holds
seq1 is convergent
let seq, seq1 be sequence of X; :: thesis: ( seq1 is subsequence of seq & seq is convergent implies seq1 is convergent )
assume that
A1: seq1 is subsequence of seq and
A2: seq is convergent ; :: thesis: seq1 is convergent
consider g1 being Element of X such that
A3: for p being Real st 0 < p holds
ex n being Element of NAT st
for m being Element of NAT st n <= m holds
||.((seq . m) - g1).|| < p by A2, CLVECT_1:def 16;
consider Nseq being increasing sequence of NAT such that
A4: seq1 = seq * Nseq by A1, VALUED_0:def 17;
take g = g1; :: according to CLVECT_1:def 16 :: thesis: for b₁ being Element of REAL holds
( b₁ <= 0 or ex b₂ being Element of NAT st
for b₃ being Element of NAT holds
( not b₂ <= b₃ or not b₁ <= ||.((seq1 . b₃) - g).|| ) )
let p be Real; :: thesis: ( p <= 0 or ex b₁ being Element of NAT st
for b₂ being Element of NAT holds
( not b₁ <= b₂ or not p <= ||.((seq1 . b₂) - g).|| ) )
assume 0 < p ; :: thesis: ex b₁ being Element of NAT st
for b₂ being Element of NAT holds
( not b₁ <= b₂ or not p <= ||.((seq1 . b₂) - g).|| )
then consider n1 being Element of NAT such that
A5: for m being Element of NAT st n1 <= m holds
||.((seq . m) - g1).|| < p by A3;
take n = n1; :: thesis: for b₁ being Element of NAT holds
( not n <= b₁ or not p <= ||.((seq1 . b₁) - g).|| )
let m be Element of NAT ; :: thesis: ( not n <= m or not p <= ||.((seq1 . m) - g).|| )
assume A6: n <= m ; :: thesis: not p <= ||.((seq1 . m) - g).||
m <= Nseq . m by SEQM_3:33;
then A7: n <= Nseq . m by A6, XXREAL_0:2;
seq1 . m = seq . (Nseq . m) by A4, FUNCT_2:21;
hence not p <= ||.((seq1 . m) - g).|| by A5, A7; :: thesis: verum