consider f being Function such that
A1: dom f = NAT and
A2: ( f . 0 = F₂() & f . 1 = F₃() & f . 2 = F₄() ) and
A3: for n being Nat holds f . (n + 3) = F₅(n,(f . n),(f . (n + 1)),(f . (n + 2))) from RECDEF_2:sch 8();
rng f c= F₁()

proof

let y be object ; :: according to TARSKI:def 3 :: thesis: ( not y in rng f or y in F₁() )
assume y in rng f ; :: thesis: y in F₁()
then consider n being object such that
A4: n in dom f and
A5: f . n = y by FUNCT_1:def 3;
reconsider n = n as Nat by A1, A4;

per cases ( n <= 2 or n > 2 ) ;

suppose n <= 2 ; :: thesis: y in F₁()

then not not n = 0 & ... & not n = 2 ;
hence y in F₁() by A2, A5; :: thesis: verum

end;

suppose n > 2 ; :: thesis: y in F₁()

then 2 + 1 <= n by NAT_1:13;
then n - 3 in NAT by INT_1:5;
then f . ((n - 3) + 3) = F₅((n - 3),(f . (n - 3)),(f . ((n - 3) + 1)),(f . ((n - 3) + 2))) by A3;
hence y in F₁() by A5; :: thesis: verum

end;

end;

end;

then f is sequence of F₁() by A1, FUNCT_2:def 1, RELSET_1:4;
hence ex f being sequence of F₁() st
( f . 0 = F₂() & f . 1 = F₃() & f . 2 = F₄() & ( for n being Nat holds f . (n + 3) = F₅(n,(f . n),(f . (n + 1)),(f . (n + 2))) ) ) by A2, A3; :: thesis: verum