let D be non empty set ; :: thesis: for F being BinOp of D
for p being FinSequence of D st F is commutative & F is associative & F is having_a_unity & F is having_an_inverseOp holds
. (F "**" p) = F "**" ( * p)

let F be BinOp of D; :: thesis: for p being FinSequence of D st F is commutative & F is associative & F is having_a_unity & F is having_an_inverseOp holds
. (F "**" p) = F "**" ( * p)

let p be FinSequence of D; :: thesis: ( F is commutative & F is associative & F is having_a_unity & F is having_an_inverseOp implies . (F "**" p) = F "**" ( * p) )
assume that
A1: ( F is commutative & F is associative ) and
A2: F is having_a_unity and
A3: F is having_an_inverseOp ; :: thesis: . (F "**" p) = F "**" ( * p)
set e = the_unity_wrt F;
set u = the_inverseOp_wrt F;
the_inverseOp_wrt F is_distributive_wrt F by ;
then A4: for d1, d2 being Element of D holds . (F . (d1,d2)) = F . (( . d1),( . d2)) ;
(the_inverseOp_wrt F) . () = the_unity_wrt F by ;
hence (the_inverseOp_wrt F) . (F "**" p) = F "**" ( * p) by A2, A4, Th28; :: thesis: verum