let D, E be non empty set ; :: thesis: for d being Element of D
for i being natural Number
for h being Function of D,E
for T being Tuple of i,D
for F being BinOp of D
for H being BinOp of E st ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) holds
h * (F [;] (d,T)) = H [;] ((h . d),(h * T))
let d be Element of D; :: thesis: for i being natural Number
for h being Function of D,E
for T being Tuple of i,D
for F being BinOp of D
for H being BinOp of E st ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) holds
h * (F [;] (d,T)) = H [;] ((h . d),(h * T))
let i be natural Number ; :: thesis: for h being Function of D,E
for T being Tuple of i,D
for F being BinOp of D
for H being BinOp of E st ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) holds
h * (F [;] (d,T)) = H [;] ((h . d),(h * T))
let h be Function of D,E; :: thesis: for T being Tuple of i,D
for F being BinOp of D
for H being BinOp of E st ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) holds
h * (F [;] (d,T)) = H [;] ((h . d),(h * T))
let T be Tuple of i,D; :: thesis: for F being BinOp of D
for H being BinOp of E st ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) holds
h * (F [;] (d,T)) = H [;] ((h . d),(h * T))
let F be BinOp of D; :: thesis: for H being BinOp of E st ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) holds
h * (F [;] (d,T)) = H [;] ((h . d),(h * T))
let H be BinOp of E; :: thesis: ( ( for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ) implies h * (F [;] (d,T)) = H [;] ((h . d),(h * T)) )
assume A1: for d1, d2 being Element of D holds h . (F . (d1,d2)) = H . ((h . d1),(h . d2)) ; :: thesis: h * (F [;] (d,T)) = H [;] ((h . d),(h * T))

per cases ( i = 0 or i <> 0 ) ;

suppose A2: i = 0 ; :: thesis: h * (F [;] (d,T)) = H [;] ((h . d),(h * T))

then F [;] (d,T) = <*> D by Lm2;
then A3: h * (F [;] (d,T)) = <*> E ;
h * T = <*> E by A2;
hence h * (F [;] (d,T)) = H [;] ((h . d),(h * T)) by A3, FINSEQ_2:79; :: thesis: verum

end;

suppose i <> 0 ; :: thesis: h * (F [;] (d,T)) = H [;] ((h . d),(h * T))

then reconsider C = Seg i as non empty set ;
T is Function of C,D by Lm4;
hence h * (F [;] (d,T)) = H [;] ((h . d),(h * T)) by A1, Th38; :: thesis: verum

end;

end;