theorem
  for Y being Hausdorff non empty TopSpace,
  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
  proof
    let Y be Hausdorff non empty TopSpace,
        f be Function of [:NAT,NAT:],Y;
    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;
    now
      dom lim_in_cod1(f,Frechet_Filter(NAT)) = NAT by FUNCT_2:def 1;
      hence dom lim_in_cod1(f,Frechet_Filter(NAT))
        = dom lim_in_cod1 Rseq by FUNCT_2:def 1;
      thus for t be 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
      proof
        let t be object;
        assume t in dom lim_in_cod1(f,Frechet_Filter(NAT));
        then reconsider t1 = t as Element of NAT;
A4:     {(lim_in_cod1(f,Frechet_Filter(NAT))).t1}
          = lim_filter(ProjMap2(f,t1),Frechet_Filter(NAT)) by A1,Def6;
        lim_filter(ProjMap2(f,t1),Frechet_Filter(NAT))
          = {lim ProjMap2(Rseq,t1)} by A1,A3,A2,Th74
         .= {(lim_in_cod1 Rseq).t1} by DBLSEQ_1:def 5;
        hence thesis by A4,ZFMISC_1:3;
      end;
    end;
    hence thesis by FUNCT_1:def 11;
  end;
