set F1 = n -Matrices_over L;
defpred S1[ object , object , object ] means ex X, Y, Z being Matrix of n,L st
( $1 = X & $2 = Y & $3 = Z & Z = X + Y );
A1: for x, y being object st x in n -Matrices_over L & y in n -Matrices_over L holds
ex z being object st
( z in n -Matrices_over L & S1[x,y,z] )
proof
let x, y be object ; :: thesis: ( x in n -Matrices_over L & y in n -Matrices_over L implies ex z being object st
( z in n -Matrices_over L & S1[x,y,z] ) )

assume ( x in n -Matrices_over L & y in n -Matrices_over L ) ; :: thesis: ex z being object st
( z in n -Matrices_over L & S1[x,y,z] )

then reconsider A = x, B = y as Matrix of n,L by MATRIX_1:2;
take z = A + B; :: thesis: ( z in n -Matrices_over L & S1[x,y,z] )
z is Element of n -Matrices_over L by MATRIX_1:2;
hence z in n -Matrices_over L ; :: thesis: S1[x,y,z]
thus S1[x,y,z] ; :: thesis: verum
end;
consider f being Function of [:(n -Matrices_over L),(n -Matrices_over L):],(n -Matrices_over L) such that
A2: for x, y being object st x in n -Matrices_over L & y in n -Matrices_over L holds
S1[x,y,f . (x,y)] from BINOP_1:sch 1(A1);
reconsider f = f as BinOp of (n -Matrices_over L) ;
take f ; :: thesis: for A, B being Element of n -Matrices_over L holds f . (A,B) = A + B
for A, B being Element of n -Matrices_over L holds f . (A,B) = A + B
proof
let A, B be Element of n -Matrices_over L; :: thesis: f . (A,B) = A + B
S1[A,B,f . (A,B)] by A2;
hence f . (A,B) = A + B ; :: thesis: verum
end;
hence for A, B being Element of n -Matrices_over L holds f . (A,B) = A + B ; :: thesis: verum