:: MATRIX_4 semantic presentation

definition
let c1 be Field;
let c2, c3 be Matrix of c1;
func c2 - c3 -> Matrix of a1 equals :: MATRIX_4:def 1
a2 + (- a3);
correctness
coherence
c2 + (- c3) is Matrix of c1
;
;
end;

:: deftheorem Def1 defines - MATRIX_4:def 1 :
for b1 being Field
for b2, b3 being Matrix of b1 holds b2 - b3 = b2 + (- b3);

theorem Th1: :: MATRIX_4:1
for b1 being Field
for b2 being Matrix of b1 st len b2 > 0 holds
- (- b2) = b2
proof end;

theorem Th2: :: MATRIX_4:2
for b1 being Field
for b2 being Matrix of b1 st len b2 > 0 holds
b2 + (- b2) = 0. b1,(len b2),(width b2)
proof end;

theorem Th3: :: MATRIX_4:3
for b1 being Field
for b2 being Matrix of b1 st len b2 > 0 holds
b2 - b2 = 0. b1,(len b2),(width b2) by Th2;

theorem Th4: :: MATRIX_4:4
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 & b2 + b4 = b3 + b4 holds
b2 = b3
proof end;

theorem Th5: :: MATRIX_4:5
for b1 being Field
for b2, b3 being Matrix of b1 st len b3 > 0 holds
b2 - (- b3) = b2 + b3 by Th1;

theorem Th6: :: MATRIX_4:6
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 & b2 = b2 + b3 holds
b3 = 0. b1,(len b2),(width b2)
proof end;

theorem Th7: :: MATRIX_4:7
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 & b2 - b3 = 0. b1,(len b2),(width b2) holds
b2 = b3
proof end;

theorem Th8: :: MATRIX_4:8
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 & b2 + b3 = 0. b1,(len b2),(width b2) holds
b3 = - b2
proof end;

theorem Th9: :: MATRIX_4:9
for b1, b2 being Nat
for b3 being Field st b1 > 0 holds
- (0. b3,b1,b2) = 0. b3,b1,b2
proof end;

theorem Th10: :: MATRIX_4:10
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 & b3 - b2 = b3 holds
b2 = 0. b1,(len b2),(width b2)
proof end;

theorem Th11: :: MATRIX_4:11
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = b2 - (b3 - b3)
proof end;

theorem Th12: :: MATRIX_4:12
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
- (b2 + b3) = (- b2) + (- b3)
proof end;

theorem Th13: :: MATRIX_4:13
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 - (b2 - b3) = b3
proof end;

theorem Th14: :: MATRIX_4:14
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 & b2 - b4 = b3 - b4 holds
b2 = b3
proof end;

theorem Th15: :: MATRIX_4:15
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 & b4 - b2 = b4 - b3 holds
b2 = b3
proof end;

theorem Th16: :: MATRIX_4:16
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
(b2 - b3) - b4 = (b2 - b4) - b3
proof end;

theorem Th17: :: MATRIX_4:17
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 - b4 = (b2 - b3) - (b4 - b3)
proof end;

theorem Th18: :: MATRIX_4:18
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
(b4 - b2) - (b4 - b3) = b3 - b2
proof end;

theorem Th19: :: MATRIX_4:19
for b1 being Field
for b2, b3, b4, b5 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & len b4 = len b5 & width b2 = width b3 & width b3 = width b4 & width b4 = width b5 & len b2 > 0 & b2 - b3 = b4 - b5 holds
b2 - b4 = b3 - b5
proof end;

theorem Th20: :: MATRIX_4:20
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = b2 + (b3 - b3)
proof end;

theorem Th21: :: MATRIX_4:21
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = (b2 + b3) - b3
proof end;

theorem Th22: :: MATRIX_4:22
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = (b2 - b3) + b3
proof end;

theorem Th23: :: MATRIX_4:23
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 + b4 = (b2 + b3) + (b4 - b3)
proof end;

theorem Th24: :: MATRIX_4:24
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
(b2 + b3) - b4 = (b2 - b4) + b3
proof end;

theorem Th25: :: MATRIX_4:25
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
(b2 - b3) + b4 = (b4 - b3) + b2
proof end;

theorem Th26: :: MATRIX_4:26
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 + b4 = (b2 + b3) - (b3 - b4)
proof end;

theorem Th27: :: MATRIX_4:27
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 - b4 = (b2 + b3) - (b4 + b3)
proof end;

theorem Th28: :: MATRIX_4:28
for b1 being Field
for b2, b3, b4, b5 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & len b4 = len b5 & width b2 = width b3 & width b3 = width b4 & width b4 = width b5 & len b2 > 0 & b2 + b3 = b4 + b5 holds
b2 - b4 = b5 - b3
proof end;

theorem Th29: :: MATRIX_4:29
for b1 being Field
for b2, b3, b4, b5 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & len b4 = len b5 & width b2 = width b3 & width b3 = width b4 & width b4 = width b5 & len b2 > 0 & b2 - b4 = b5 - b3 holds
b2 + b3 = b4 + b5
proof end;

theorem Th30: :: MATRIX_4:30
for b1 being Field
for b2, b3, b4, b5 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & len b4 = len b5 & width b2 = width b3 & width b3 = width b4 & width b4 = width b5 & len b2 > 0 & b2 + b3 = b4 - b5 holds
b2 + b5 = b4 - b3
proof end;

theorem Th31: :: MATRIX_4:31
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 - (b3 + b4) = (b2 - b3) - b4
proof end;

theorem Th32: :: MATRIX_4:32
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 - (b3 - b4) = (b2 - b3) + b4
proof end;

theorem Th33: :: MATRIX_4:33
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 - (b3 - b4) = b2 + (b4 - b3)
proof end;

theorem Th34: :: MATRIX_4:34
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
b2 - b4 = (b2 - b3) + (b3 - b4)
proof end;

theorem Th35: :: MATRIX_4:35
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 & - b2 = - b3 holds
b2 = b3
proof end;

theorem Th36: :: MATRIX_4:36
for b1 being Field
for b2 being Matrix of b1 st len b2 > 0 & - b2 = 0. b1,(len b2),(width b2) holds
b2 = 0. b1,(len b2),(width b2)
proof end;

theorem Th37: :: MATRIX_4:37
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 & b2 + (- b3) = 0. b1,(len b2),(width b2) holds
b2 = b3
proof end;

theorem Th38: :: MATRIX_4:38
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = (b2 + b3) + (- b3)
proof end;

theorem Th39: :: MATRIX_4:39
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = b2 + (b3 + (- b3))
proof end;

theorem Th40: :: MATRIX_4:40
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = ((- b3) + b2) + b3
proof end;

theorem Th41: :: MATRIX_4:41
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
- ((- b2) + b3) = b2 + (- b3)
proof end;

theorem Th42: :: MATRIX_4:42
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 + b3 = - ((- b2) + (- b3))
proof end;

theorem Th43: :: MATRIX_4:43
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
- (b2 - b3) = b3 - b2
proof end;

theorem Th44: :: MATRIX_4:44
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
(- b2) - b3 = (- b3) - b2
proof end;

theorem Th45: :: MATRIX_4:45
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = (- b3) - ((- b2) - b3)
proof end;

theorem Th46: :: MATRIX_4:46
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
((- b2) - b3) - b4 = ((- b2) - b4) - b3
proof end;

theorem Th47: :: MATRIX_4:47
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
((- b2) - b3) - b4 = ((- b3) - b4) - b2
proof end;

theorem Th48: :: MATRIX_4:48
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
((- b2) - b3) - b4 = ((- b4) - b3) - b2
proof end;

theorem Th49: :: MATRIX_4:49
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 holds
(b4 - b2) - (b4 - b3) = - (b2 - b3)
proof end;

theorem Th50: :: MATRIX_4:50
for b1 being Field
for b2 being Matrix of b1 st len b2 > 0 holds
(0. b1,(len b2),(width b2)) - b2 = - b2
proof end;

theorem Th51: :: MATRIX_4:51
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 + b3 = b2 - (- b3) by Th5;

theorem Th52: :: MATRIX_4:52
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 & len b2 > 0 holds
b2 = b2 - (b3 + (- b3))
proof end;

theorem Th53: :: MATRIX_4:53
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 & b2 - b4 = b3 + (- b4) holds
b2 = b3
proof end;

theorem Th54: :: MATRIX_4:54
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b2 = len b3 & len b3 = len b4 & width b2 = width b3 & width b3 = width b4 & len b2 > 0 & b4 - b2 = b4 + (- b3) holds
b2 = b3
proof end;

theorem Th55: :: MATRIX_4:55
for b1 being Field
for b2, b3 being Matrix of b1 st len b2 = len b3 & width b2 = width b3 holds
Indices b2 = Indices b3
proof end;

theorem Th56: :: MATRIX_4:56
for b1 being Field
for b2, b3, b4 being FinSequence of b1 st len b2 = len b3 & len b3 = len b4 holds
mlt (b2 + b3),b4 = (mlt b2,b4) + (mlt b3,b4)
proof end;

theorem Th57: :: MATRIX_4:57
for b1 being Field
for b2, b3, b4 being FinSequence of b1 st len b2 = len b3 & len b3 = len b4 holds
mlt b4,(b2 + b3) = (mlt b4,b2) + (mlt b4,b3)
proof end;

theorem Th58: :: MATRIX_4:58
for b1 being non empty set
for b2 being Matrix of b1 st len b2 > 0 holds
for b3 being Nat holds
( b2 is Matrix of b3, width b2,b1 iff b3 = len b2 ) by MATRIX_1:20, MATRIX_1:def 3;

theorem Th59: :: MATRIX_4:59
for b1 being Nat
for b2 being Field
for b3 being Nat
for b4, b5 being Matrix of b2 st len b4 = len b5 & width b4 = width b5 & ex b6 being Nat st [b1,b6] in Indices b4 holds
Line (b4 + b5),b1 = (Line b4,b1) + (Line b5,b1)
proof end;

theorem Th60: :: MATRIX_4:60
for b1 being Field
for b2 being Nat
for b3, b4 being Matrix of b1 st len b3 = len b4 & width b3 = width b4 & ex b5 being Nat st [b5,b2] in Indices b3 holds
Col (b3 + b4),b2 = (Col b3,b2) + (Col b4,b2)
proof end;

theorem Th61: :: MATRIX_4:61
for b1 being Field
for b2, b3 being FinSequence of b1 st len b2 = len b3 holds
Sum (b2 + b3) = (Sum b2) + (Sum b3)
proof end;

theorem Th62: :: MATRIX_4:62
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b3 = len b4 & width b3 = width b4 & width b2 = len b3 & len b2 > 0 & len b3 > 0 holds
b2 * (b3 + b4) = (b2 * b3) + (b2 * b4)
proof end;

theorem Th63: :: MATRIX_4:63
for b1 being Field
for b2, b3, b4 being Matrix of b1 st len b3 = len b4 & width b3 = width b4 & len b2 = width b3 & len b3 > 0 & len b2 > 0 holds
(b3 + b4) * b2 = (b3 * b2) + (b4 * b2)
proof end;

theorem Th64: :: MATRIX_4:64
for b1 being Field
for b2, b3, b4 being Nat
for b5 being Matrix of b2,b3,b1
for b6 being Matrix of b3,b4,b1 st width b5 = len b6 & 0 < len b5 & 0 < len b6 holds
b5 * b6 is Matrix of b2,b4,b1
proof end;