let Rseq be Function of [:NAT,NAT:],REAL; :: thesis: for Y being non empty Hausdorff TopSpace
for f being Function of [:NAT,NAT:],Y st ( for x being Element of NAT holds lim_filter ((ProjMap2 (f,x)),(Frechet_Filter NAT)) <> {} ) & f = Rseq & Y = R^1 holds
lim_in_cod1 (f,(Frechet_Filter NAT)) = lim_in_cod1 Rseq

let Y be non empty Hausdorff TopSpace; :: thesis: for f being Function of [:NAT,NAT:],Y st ( for x being Element of NAT holds lim_filter ((ProjMap2 (f,x)),(Frechet_Filter NAT)) <> {} ) & f = Rseq & Y = R^1 holds
lim_in_cod1 (f,(Frechet_Filter NAT)) = lim_in_cod1 Rseq

let f be Function of [:NAT,NAT:],Y; :: thesis: ( ( for x being Element of NAT holds lim_filter ((ProjMap2 (f,x)),(Frechet_Filter NAT)) <> {} ) & f = Rseq & Y = R^1 implies lim_in_cod1 (f,(Frechet_Filter NAT)) = lim_in_cod1 Rseq )
assume that
A1: for x being Element of NAT holds lim_filter ((ProjMap2 (f,x)),(Frechet_Filter NAT)) <> {} and
A2: f = Rseq and
A3: Y = R^1 ; :: thesis: lim_in_cod1 (f,(Frechet_Filter NAT)) = lim_in_cod1 Rseq
now :: thesis: ( dom (lim_in_cod1 (f,(Frechet_Filter NAT))) = dom (lim_in_cod1 Rseq) & ( for t being object st t in dom (lim_in_cod1 (f,(Frechet_Filter NAT))) holds
(lim_in_cod1 (f,(Frechet_Filter NAT))) . t = (lim_in_cod1 Rseq) . t ) )
end;
hence lim_in_cod1 (f,(Frechet_Filter NAT)) = lim_in_cod1 Rseq by FUNCT_1:def 11; :: thesis: verum