let f, g be BinOp of (n -Matrices_over L); :: 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 g . (A,B) = A + B ) implies f = g )
set F1 = n -Matrices_over L;
assume A3: for A, B being Element of n -Matrices_over L holds f . (A,B) = A + B ; :: thesis: ( ex A, B being Element of n -Matrices_over L st not g . (A,B) = A + B or f = g )
assume A4: for A, B being Element of n -Matrices_over L holds g . (A,B) = A + B ; :: thesis: f = g
for A, B being Element of n -Matrices_over L holds f . (A,B) = g . (A,B)
proof
let A, B be Element of n -Matrices_over L; :: thesis: f . (A,B) = g . (A,B)
thus f . (A,B) = A + B by A3
.= g . (A,B) by A4 ; :: thesis: verum
end;
hence f = g by BINOP_1:2; :: thesis: verum