deffunc H1( Element of NAT ) -> set = f . (D + n);
set p = f /^ n;
per cases ( n < len f or len f <= n ) ;
suppose A1: n < len f ; :: thesis: f /^ n is D -valued
then reconsider k = (len f) - n as Nat by NAT_1:21;
A2: len (f /^ n) = k by A1, Th7;
A3: rng (f /^ n) c= rng f
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in rng (f /^ n) or x in rng f )
assume x in rng (f /^ n) ; :: thesis: x in rng f
then consider m being Element of NAT such that
A4: m in dom (f /^ n) and
A5: (f /^ n) . m = x by Th3;
m + n < k + n by A2, XREAL_1:6, A4, AFINSQ_1:86;
then A6: m + n in dom f by AFINSQ_1:86;
(f /^ n) . m = f . (m + n) by A4, Def2;
hence x in rng f by A5, A6, FUNCT_1:def 3; :: thesis: verum
end;
for f2 being XFinSequence st rng f2 c= D holds
f2 is XFinSequence of D by RELAT_1:def 19;
hence f /^ n is D -valued by A3, XBOOLE_1:1; :: thesis: verum
end;
suppose len f <= n ; :: thesis: f /^ n is D -valued
then f /^ n = <%> D by Th6;
hence f /^ n is D -valued ; :: thesis: verum
end;
end;