let D be non empty set ; :: thesis: for d being Element of D
for i being Nat
for T being Tuple of i,D
for F being BinOp of D
for u being UnOp of D st u is_distributive_wrt F holds
u * (F [;] (d,T)) = F [;] ((u . d),(u * T))
let d be Element of D; :: thesis: for i being Nat
for T being Tuple of i,D
for F being BinOp of D
for u being UnOp of D st u is_distributive_wrt F holds
u * (F [;] (d,T)) = F [;] ((u . d),(u * T))
let i be Nat; :: thesis: for T being Tuple of i,D
for F being BinOp of D
for u being UnOp of D st u is_distributive_wrt F holds
u * (F [;] (d,T)) = F [;] ((u . d),(u * T))
let T be Tuple of i,D; :: thesis: for F being BinOp of D
for u being UnOp of D st u is_distributive_wrt F holds
u * (F [;] (d,T)) = F [;] ((u . d),(u * T))
let F be BinOp of D; :: thesis: for u being UnOp of D st u is_distributive_wrt F holds
u * (F [;] (d,T)) = F [;] ((u . d),(u * T))
let u be UnOp of D; :: thesis: ( u is_distributive_wrt F implies u * (F [;] (d,T)) = F [;] ((u . d),(u * T)) )
assume for d1, d2 being Element of D holds u . (F . (d1,d2)) = F . ((u . d1),(u . d2)) ; :: according to BINOP_1:def 20 :: thesis: u * (F [;] (d,T)) = F [;] ((u . d),(u * T))
hence u * (F [;] (d,T)) = F [;] ((u . d),(u * T)) by Th50; :: thesis: verum