deffunc H1( Nat) -> FinSequence of REAL = mlt ((Line (MR,$1)),(FinSeq_log (2,(Line (MR,$1)))));
consider p being FinSequence such that
A2:
len p = len MR
and
A3:
for k being Nat st k in dom p holds
p . k = H1(k)
from FINSEQ_1:sch 2();
A4:
rng p c= REAL *
A7:
for x being object st x in rng p holds
ex q being FinSequence st
( q = x & len q = width MR )
proof
let x be
object ;
( x in rng p implies ex q being FinSequence st
( q = x & len q = width MR ) )
assume
x in rng p
;
ex q being FinSequence st
( q = x & len q = width MR )
then consider j being
Nat such that A8:
j in dom p
and A9:
x = p . j
by FINSEQ_2:10;
j in dom MR
by A2, A8, FINSEQ_3:29;
then
Line (
MR,
j) is
nonnegative
by A1, Th19;
then A10:
len (FinSeq_log (2,(Line (MR,j)))) = len (Line (MR,j))
by Def6;
len (Line (MR,j)) = width MR
by MATRIX_0:def 7;
then A11:
len (mlt ((Line (MR,j)),(FinSeq_log (2,(Line (MR,j)))))) = width MR
by A10, MATRPROB:30;
x = mlt (
(Line (MR,j)),
(FinSeq_log (2,(Line (MR,j)))))
by A3, A8, A9;
hence
ex
q being
FinSequence st
(
q = x &
len q = width MR )
by A11;
verum
end;
then reconsider p = p as Matrix of REAL by A4, FINSEQ_1:def 4, MATRIX_0:def 1;
take
p
; ( len p = len MR & width p = width MR & ( for k being Nat st k in dom p holds
p . k = mlt ((Line (MR,k)),(FinSeq_log (2,(Line (MR,k))))) ) )
width p = width MR
hence
( len p = len MR & width p = width MR & ( for k being Nat st k in dom p holds
p . k = mlt ((Line (MR,k)),(FinSeq_log (2,(Line (MR,k))))) ) )
by A2, A3; verum