let R be Ring; :: thesis: for n being Nat
for F being BinOp of (n -invertible_Matrices_over R) st F = (matrix_mult (n,R)) || (n -invertible_Matrices_over R) holds
( F is having_a_unity & F is associative & F is having_an_inverseOp )

let n be Nat; :: thesis: for F being BinOp of (n -invertible_Matrices_over R) st F = (matrix_mult (n,R)) || (n -invertible_Matrices_over R) holds
( F is having_a_unity & F is associative & F is having_an_inverseOp )

let F be BinOp of (n -invertible_Matrices_over R); :: thesis: ( F = (matrix_mult (n,R)) || (n -invertible_Matrices_over R) implies ( F is having_a_unity & F is associative & F is having_an_inverseOp ) )
assume A1: F = (matrix_mult (n,R)) || (n -invertible_Matrices_over R) ; :: thesis: ( F is having_a_unity & F is associative & F is having_an_inverseOp )
then ex e1 being Element of n -invertible_Matrices_over R st e1 is_a_unity_wrt F by Th152;
hence F is having_a_unity by SETWISEO:def 2; :: thesis: ( F is associative & F is having_an_inverseOp )
for a, b, c being Element of n -invertible_Matrices_over R holds F . (a,(F . (b,c))) = F . ((F . (a,b)),c)
proof
let a, b, c be Element of n -invertible_Matrices_over R; :: thesis: F . (a,(F . (b,c))) = F . ((F . (a,b)),c)
reconsider X = a, Y = b, Z = c as invertible Matrix of n,R by Th145;
reconsider A = a, B = b, C = c as Element of n -Matrices_over R ;
set mu = matrix_mult (n,R);
set U = n -invertible_Matrices_over R;
A2: ( [a,(F . (b,c))] in [:(n -invertible_Matrices_over R),(n -invertible_Matrices_over R):] & [(F . (a,b)),c] in [:(n -invertible_Matrices_over R),(n -invertible_Matrices_over R):] & [a,b] in [:(n -invertible_Matrices_over R),(n -invertible_Matrices_over R):] & [b,c] in [:(n -invertible_Matrices_over R),(n -invertible_Matrices_over R):] ) ;
A3: ( F . (a,b) = (matrix_mult (n,R)) . (A,B) & (matrix_mult (n,R)) . (A,B) = X * Y ) by A1, A2, Def5, FUNCT_1:49;
A4: ( F . (b,c) = (matrix_mult (n,R)) . (B,C) & (matrix_mult (n,R)) . (B,C) = Y * Z ) by A1, A2, Def5, FUNCT_1:49;
A5: ( len X = n & width X = n & len Y = n & width Y = n & len Z = n & width Z = n ) by MATRIX_0:24;
thus F . (a,(F . (b,c))) = (matrix_mult (n,R)) . (A,((matrix_mult (n,R)) . (B,C))) by A1, A2, A4, FUNCT_1:49
.= X * (Y * Z) by A4, Def5
.= (X * Y) * Z by A5, MATRIX_3:33
.= (matrix_mult (n,R)) . (((matrix_mult (n,R)) . (A,B)),C) by A3, Def5
.= F . ((F . (a,b)),c) by A1, A2, A3, FUNCT_1:49 ; :: thesis: verum
end;
hence F is associative by BINOP_1:def 3; :: thesis: F is having_an_inverseOp
thus F is having_an_inverseOp by A1, Th155; :: thesis: verum