let M be Matrix of m,n,K; :: thesis: ( M = A + B iff for i, j being Nat st [i,j] in Indices A holds
M * (i,j) = (A * (i,j)) + (B * (i,j)) )

thus ( M = A + B implies for i, j being Nat st [i,j] in Indices A holds
M * (i,j) = (A * (i,j)) + (B * (i,j)) ) by Def3a; :: thesis: ( ( for i, j being Nat st [i,j] in Indices A holds
M * (i,j) = (A * (i,j)) + (B * (i,j)) ) implies M = A + B )

assume A1: for i, j being Nat st [i,j] in Indices A holds
M * (i,j) = (A * (i,j)) + (B * (i,j)) ; :: thesis: M = A + B
A2: Indices M = Indices A by MATRIX_0:26;
A3: len M = m by MATRIX_0:def 2;
A5: len (A + B) = m by MATRIX_0:def 2;
A4: now :: thesis: width M = width (A + B)
per cases ( m = 0 or m > 0 ) by NAT_1:3;
suppose A6: m = 0 ; :: thesis: width M = width (A + B)
hence width M = 0 by MATRIX_0:22
.= width (A + B) by A6, MATRIX_0:22 ;
:: thesis: verum
end;
suppose A7: m > 0 ; :: thesis: width M = width (A + B)
hence width M = n by A3, MATRIX_0:20
.= width (A + B) by A5, A7, MATRIX_0:20 ;
:: thesis: verum
end;
end;
end;
for i, j being Nat st [i,j] in Indices M holds
M * (i,j) = (A + B) * (i,j)
proof
let i, j be Nat; :: thesis: ( [i,j] in Indices M implies M * (i,j) = (A + B) * (i,j) )
assume A5: [i,j] in Indices M ; :: thesis: M * (i,j) = (A + B) * (i,j)
hence M * (i,j) = (A * (i,j)) + (B * (i,j)) by A1, A2
.= (A + B) * (i,j) by A2, A5, Def3a ;
:: thesis: verum
end;
hence M = A + B by A3, A5, A4, MATRIX_0:21; :: thesis: verum