let RNS1, RNS2 be RealLinearSpace; :: thesis: ( RLSStruct(# the carrier of RNS1, the ZeroF of RNS1, the addF of RNS1, the Mult of RNS1 #) = RLSStruct(# the carrier of RNS2, the ZeroF of RNS2, the addF of RNS2, the Mult of RNS2 #) implies for FFr being FinSequence of RNS1
for fr being Function of RNS1,REAL
for Fv being FinSequence of RNS2
for fv being Function of RNS2,REAL st fr = fv & FFr = Fv holds
fr (#) FFr = fv (#) Fv )

assume A1: RLSStruct(# the carrier of RNS1, the ZeroF of RNS1, the addF of RNS1, the Mult of RNS1 #) = RLSStruct(# the carrier of RNS2, the ZeroF of RNS2, the addF of RNS2, the Mult of RNS2 #) ; :: thesis: for FFr being FinSequence of RNS1
for fr being Function of RNS1,REAL
for Fv being FinSequence of RNS2
for fv being Function of RNS2,REAL st fr = fv & FFr = Fv holds
fr (#) FFr = fv (#) Fv

let FFr be FinSequence of RNS1; :: thesis: for fr being Function of RNS1,REAL
for Fv being FinSequence of RNS2
for fv being Function of RNS2,REAL st fr = fv & FFr = Fv holds
fr (#) FFr = fv (#) Fv

let fr be Function of RNS1,REAL; :: thesis: for Fv being FinSequence of RNS2
for fv being Function of RNS2,REAL st fr = fv & FFr = Fv holds
fr (#) FFr = fv (#) Fv

let Fv be FinSequence of RNS2; :: thesis: for fv being Function of RNS2,REAL st fr = fv & FFr = Fv holds
fr (#) FFr = fv (#) Fv

let fv be Function of RNS2,REAL; :: thesis: ( fr = fv & FFr = Fv implies fr (#) FFr = fv (#) Fv )
assume A2: ( fr = fv & FFr = Fv ) ; :: thesis: fr (#) FFr = fv (#) Fv
then A3: len (fv (#) Fv) = len FFr by RLVECT_2:def 7;
for i being Nat st i in dom (fv (#) Fv) holds
(fv (#) Fv) . i = (fr . (FFr /. i)) * (FFr /. i)
proof
let i be Nat; :: thesis: ( i in dom (fv (#) Fv) implies (fv (#) Fv) . i = (fr . (FFr /. i)) * (FFr /. i) )
assume i in dom (fv (#) Fv) ; :: thesis: (fv (#) Fv) . i = (fr . (FFr /. i)) * (FFr /. i)
hence (fv (#) Fv) . i = (fv . (Fv /. i)) * (Fv /. i) by RLVECT_2:def 7
.= (fr . (FFr /. i)) * (FFr /. i) by A2, A1 ;
:: thesis: verum
end;
hence fr (#) FFr = fv (#) Fv by A3, A1, RLVECT_2:def 7; :: thesis: verum