:: BHSP_1 semantic presentation

definition
attr a1 is strict;
struct UNITSTR -> RLSStruct ;
aggr UNITSTR(# carrier, Zero, add, Mult, scalar #) -> UNITSTR ;
sel scalar c1 -> Function of [:the carrier of a1,the carrier of a1:], REAL ;
end;

registration
cluster non empty strict UNITSTR ;
existence
ex b1 being UNITSTR st
( not b1 is empty & b1 is strict )
proof end;
end;

registration
let c1 be non empty set ;
let c2 be Element of c1;
let c3 be BinOp of c1;
let c4 be Function of [:REAL ,c1:],c1;
let c5 be Function of [:c1,c1:], REAL ;
cluster UNITSTR(# a1,a2,a3,a4,a5 #) -> non empty ;
coherence
not UNITSTR(# c1,c2,c3,c4,c5 #) is empty
proof end;
end;

deffunc H1( UNITSTR ) -> Element of the carrier of a1 = 0. a1;

definition
let c1 be non empty UNITSTR ;
let c2, c3 be Point of c1;
func c2 .|. c3 -> Real equals :: BHSP_1:def 1
the scalar of a1 . [a2,a3];
correctness
coherence
the scalar of c1 . [c2,c3] is Real
;
;
end;

:: deftheorem Def1 defines .|. BHSP_1:def 1 :
for b1 being non empty UNITSTR
for b2, b3 being Point of b1 holds b2 .|. b3 = the scalar of b1 . [b2,b3];

consider c1 being RealLinearSpace;

Lemma1: the carrier of ((0). c1) = {(0. c1)}
by RLSUB_1:def 3;

reconsider c2 = [:the carrier of ((0). c1),the carrier of ((0). c1):] --> 0 as Function of [:the carrier of ((0). c1),the carrier of ((0). c1):], REAL by FUNCOP_1:57;

Lemma2: for b1, b2 being VECTOR of ((0). c1) holds c2 . [b1,b2] = 0
by FUNCOP_1:13;

0. c1 in the carrier of ((0). c1)
by Lemma1, TARSKI:def 1;

then Lemma3: c2 . [(0. c1),(0. c1)] = 0
by Lemma2;

Lemma4: for b1, b2 being VECTOR of ((0). c1) holds c2 . [b1,b2] = c2 . [b2,b1]
proof end;

Lemma5: for b1, b2, b3 being VECTOR of ((0). c1) holds c2 . [(b1 + b2),b3] = (c2 . [b1,b3]) + (c2 . [b2,b3])
proof end;

Lemma6: for b1, b2 being VECTOR of ((0). c1)
for b3 being Real holds c2 . [(b3 * b1),b2] = b3 * (c2 . [b1,b2])
proof end;

set c3 = UNITSTR(# the carrier of ((0). c1),the Zero of ((0). c1),the add of ((0). c1),the Mult of ((0). c1),c2 #);

E7: now
let c4, c5, c6 be Point of UNITSTR(# the carrier of ((0). c1),the Zero of ((0). c1),the add of ((0). c1),the Mult of ((0). c1),c2 #);
let c7 be Real;
thus ( c4 .|. c4 = 0 iff c4 = H1( UNITSTR(# the carrier of ((0). c1),the Zero of ((0). c1),the add of ((0). c1),the Mult of ((0). c1),c2 #)) )
proof
H1( UNITSTR(# the carrier of ((0). c1),the Zero of ((0). c1),the add of ((0). c1),the Mult of ((0). c1),c2 #)) = the Zero of UNITSTR(# the carrier of ((0). c1),the Zero of ((0). c1),the add of ((0). c1),the Mult of ((0). c1),c2 #)
.= 0. ((0). c1)
.= 0. c1 by RLSUB_1:19 ;
hence ( c4 .|. c4 = 0 iff c4 = H1( UNITSTR(# the carrier of ((0). c1),the Zero of ((0). c1),the add of ((0). c1),the Mult of ((0). c1),c2 #)) ) by Lemma1, Lemma3, TARSKI:def 1;
end;
thus 0 <= c4 .|. c4 by FUNCOP_1:13;
thus c4 .|. c5 = c5 .|. c4 by Lemma4;
thus (c4 + c5) .|. c6 = (c4 .|. c6) + (c5 .|. c6)
proof
reconsider c8 = c4, c9 = c5, c10 = c6 as VECTOR of ((0). c1) ;
( (c4 + c5) .|. c6 = c2 . [(c8 + c9),c10] & c4 .|. c6 = c2 . [c8,c10] & c5 .|. c6 = c2 . [c9,c10] ) ;
hence (c4 + c5) .|. c6 = (c4 .|. c6) + (c5 .|. c6) by Lemma5;
end;
thus (c7 * c4) .|. c5 = c7 * (c4 .|. c5)
proof
reconsider c8 = c4, c9 = c5 as VECTOR of ((0). c1) ;
( (c7 * c4) .|. c5 = c2 . [(c7 * c8),c9] & c4 .|. c5 = c2 . [c8,c9] ) ;
hence (c7 * c4) .|. c5 = c7 * (c4 .|. c5) by Lemma6;
end;
end;

definition
let c4 be non empty UNITSTR ;
attr a1 is RealUnitarySpace-like means :Def2: :: BHSP_1:def 2
for b1, b2, b3 being Point of a1
for b4 being Real holds
( ( b1 .|. b1 = 0 implies b1 = 0. a1 ) & ( b1 = 0. a1 implies b1 .|. b1 = 0 ) & 0 <= b1 .|. b1 & b1 .|. b2 = b2 .|. b1 & (b1 + b2) .|. b3 = (b1 .|. b3) + (b2 .|. b3) & (b4 * b1) .|. b2 = b4 * (b1 .|. b2) );
end;

:: deftheorem Def2 defines RealUnitarySpace-like BHSP_1:def 2 :
for b1 being non empty UNITSTR holds
( b1 is RealUnitarySpace-like iff for b2, b3, b4 being Point of b1
for b5 being Real holds
( ( b2 .|. b2 = 0 implies b2 = 0. b1 ) & ( b2 = 0. b1 implies b2 .|. b2 = 0 ) & 0 <= b2 .|. b2 & b2 .|. b3 = b3 .|. b2 & (b2 + b3) .|. b4 = (b2 .|. b4) + (b3 .|. b4) & (b5 * b2) .|. b3 = b5 * (b2 .|. b3) ) );

registration
cluster non empty Abelian add-associative right_zeroed right_complementable RealLinearSpace-like strict RealUnitarySpace-like UNITSTR ;
existence
ex b1 being non empty UNITSTR st
( b1 is RealUnitarySpace-like & b1 is RealLinearSpace-like & b1 is Abelian & b1 is add-associative & b1 is right_zeroed & b1 is right_complementable & b1 is strict )
proof end;
end;

definition
mode RealUnitarySpace is non empty Abelian add-associative right_zeroed right_complementable RealLinearSpace-like RealUnitarySpace-like UNITSTR ;
end;

definition
let c4 be RealUnitarySpace;
let c5, c6 be Point of c4;
redefine func .|. as c2 .|. c3 -> Real;
commutativity
for b1, b2 being Point of c4 holds b1 .|. b2 = b2 .|. b1
by Def2;
end;

theorem Th1: :: BHSP_1:1
canceled;

theorem Th2: :: BHSP_1:2
canceled;

theorem Th3: :: BHSP_1:3
canceled;

theorem Th4: :: BHSP_1:4
canceled;

theorem Th5: :: BHSP_1:5
canceled;

theorem Th6: :: BHSP_1:6
for b1 being RealUnitarySpace holds (0. b1) .|. (0. b1) = 0 by Def2;

theorem Th7: :: BHSP_1:7
for b1 being RealUnitarySpace
for b2, b3, b4 being Point of b1 holds b2 .|. (b3 + b4) = (b2 .|. b3) + (b2 .|. b4) by Def2;

theorem Th8: :: BHSP_1:8
for b1 being Real
for b2 being RealUnitarySpace
for b3, b4 being Point of b2 holds b3 .|. (b1 * b4) = b1 * (b3 .|. b4) by Def2;

theorem Th9: :: BHSP_1:9
for b1 being Real
for b2 being RealUnitarySpace
for b3, b4 being Point of b2 holds (b1 * b3) .|. b4 = b3 .|. (b1 * b4)
proof end;

theorem Th10: :: BHSP_1:10
for b1, b2 being Real
for b3 being RealUnitarySpace
for b4, b5, b6 being Point of b3 holds ((b1 * b4) + (b2 * b5)) .|. b6 = (b1 * (b4 .|. b6)) + (b2 * (b5 .|. b6))
proof end;

theorem Th11: :: BHSP_1:11
for b1, b2 being Real
for b3 being RealUnitarySpace
for b4, b5, b6 being Point of b3 holds b4 .|. ((b1 * b5) + (b2 * b6)) = (b1 * (b4 .|. b5)) + (b2 * (b4 .|. b6)) by Th10;

theorem Th12: :: BHSP_1:12
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds (- b2) .|. b3 = b2 .|. (- b3)
proof end;

theorem Th13: :: BHSP_1:13
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds (- b2) .|. b3 = - (b2 .|. b3)
proof end;

theorem Th14: :: BHSP_1:14
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds b2 .|. (- b3) = - (b2 .|. b3) by Th13;

theorem Th15: :: BHSP_1:15
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds (- b2) .|. (- b3) = b2 .|. b3
proof end;

theorem Th16: :: BHSP_1:16
for b1 being RealUnitarySpace
for b2, b3, b4 being Point of b1 holds (b2 - b3) .|. b4 = (b2 .|. b4) - (b3 .|. b4)
proof end;

theorem Th17: :: BHSP_1:17
for b1 being RealUnitarySpace
for b2, b3, b4 being Point of b1 holds b2 .|. (b3 - b4) = (b2 .|. b3) - (b2 .|. b4)
proof end;

theorem Th18: :: BHSP_1:18
for b1 being RealUnitarySpace
for b2, b3, b4, b5 being Point of b1 holds (b2 - b3) .|. (b4 - b5) = (((b2 .|. b4) - (b2 .|. b5)) - (b3 .|. b4)) + (b3 .|. b5)
proof end;

theorem Th19: :: BHSP_1:19
for b1 being RealUnitarySpace
for b2 being Point of b1 holds (0. b1) .|. b2 = 0
proof end;

theorem Th20: :: BHSP_1:20
for b1 being RealUnitarySpace
for b2 being Point of b1 holds b2 .|. (0. b1) = 0 by Th19;

theorem Th21: :: BHSP_1:21
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds (b2 + b3) .|. (b2 + b3) = ((b2 .|. b2) + (2 * (b2 .|. b3))) + (b3 .|. b3)
proof end;

theorem Th22: :: BHSP_1:22
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds (b2 + b3) .|. (b2 - b3) = (b2 .|. b2) - (b3 .|. b3)
proof end;

theorem Th23: :: BHSP_1:23
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds (b2 - b3) .|. (b2 - b3) = ((b2 .|. b2) - (2 * (b2 .|. b3))) + (b3 .|. b3)
proof end;

theorem Th24: :: BHSP_1:24
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds abs (b2 .|. b3) <= (sqrt (b2 .|. b2)) * (sqrt (b3 .|. b3))
proof end;

definition
let c4 be RealUnitarySpace;
let c5, c6 be Point of c4;
pred c2,c3 are_orthogonal means :Def3: :: BHSP_1:def 3
a2 .|. a3 = 0;
symmetry
for b1, b2 being Point of c4 st b1 .|. b2 = 0 holds
b2 .|. b1 = 0
;
end;

:: deftheorem Def3 defines are_orthogonal BHSP_1:def 3 :
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds
( b2,b3 are_orthogonal iff b2 .|. b3 = 0 );

theorem Th25: :: BHSP_1:25
canceled;

theorem Th26: :: BHSP_1:26
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 st b2,b3 are_orthogonal holds
b2, - b3 are_orthogonal
proof end;

theorem Th27: :: BHSP_1:27
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 st b2,b3 are_orthogonal holds
- b2,b3 are_orthogonal
proof end;

theorem Th28: :: BHSP_1:28
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 st b2,b3 are_orthogonal holds
- b2, - b3 are_orthogonal
proof end;

theorem Th29: :: BHSP_1:29
for b1 being RealUnitarySpace
for b2 being Point of b1 holds b2, 0. b1 are_orthogonal
proof end;

theorem Th30: :: BHSP_1:30
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 st b2,b3 are_orthogonal holds
(b2 + b3) .|. (b2 + b3) = (b2 .|. b2) + (b3 .|. b3)
proof end;

theorem Th31: :: BHSP_1:31
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 st b2,b3 are_orthogonal holds
(b2 - b3) .|. (b2 - b3) = (b2 .|. b2) + (b3 .|. b3)
proof end;

definition
let c4 be RealUnitarySpace;
let c5 be Point of c4;
func ||.c2.|| -> Real equals :: BHSP_1:def 4
sqrt (a2 .|. a2);
correctness
coherence
sqrt (c5 .|. c5) is Real
;
;
end;

:: deftheorem Def4 defines ||. BHSP_1:def 4 :
for b1 being RealUnitarySpace
for b2 being Point of b1 holds ||.b2.|| = sqrt (b2 .|. b2);

theorem Th32: :: BHSP_1:32
for b1 being RealUnitarySpace
for b2 being Point of b1 holds
( ||.b2.|| = 0 iff b2 = 0. b1 )
proof end;

theorem Th33: :: BHSP_1:33
for b1 being Real
for b2 being RealUnitarySpace
for b3 being Point of b2 holds ||.(b1 * b3).|| = (abs b1) * ||.b3.||
proof end;

theorem Th34: :: BHSP_1:34
for b1 being RealUnitarySpace
for b2 being Point of b1 holds 0 <= ||.b2.||
proof end;

theorem Th35: :: BHSP_1:35
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds abs (b2 .|. b3) <= ||.b2.|| * ||.b3.|| by Th24;

theorem Th36: :: BHSP_1:36
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds ||.(b2 + b3).|| <= ||.b2.|| + ||.b3.||
proof end;

theorem Th37: :: BHSP_1:37
for b1 being RealUnitarySpace
for b2 being Point of b1 holds ||.(- b2).|| = ||.b2.||
proof end;

theorem Th38: :: BHSP_1:38
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds ||.b2.|| - ||.b3.|| <= ||.(b2 - b3).||
proof end;

theorem Th39: :: BHSP_1:39
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds abs (||.b2.|| - ||.b3.||) <= ||.(b2 - b3).||
proof end;

definition
let c4 be RealUnitarySpace;
let c5, c6 be Point of c4;
func dist c2,c3 -> Real equals :: BHSP_1:def 5
||.(a2 - a3).||;
correctness
coherence
||.(c5 - c6).|| is Real
;
;
end;

:: deftheorem Def5 defines dist BHSP_1:def 5 :
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds dist b2,b3 = ||.(b2 - b3).||;

theorem Th40: :: BHSP_1:40
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds dist b2,b3 = dist b3,b2
proof end;

definition
let c4 be RealUnitarySpace;
let c5, c6 be Point of c4;
redefine func dist as dist c2,c3 -> Real;
commutativity
for b1, b2 being Point of c4 holds dist b1,b2 = dist b2,b1
by Th40;
end;

theorem Th41: :: BHSP_1:41
for b1 being RealUnitarySpace
for b2 being Point of b1 holds dist b2,b2 = 0
proof end;

theorem Th42: :: BHSP_1:42
for b1 being RealUnitarySpace
for b2, b3, b4 being Point of b1 holds dist b2,b3 <= (dist b2,b4) + (dist b4,b3)
proof end;

theorem Th43: :: BHSP_1:43
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds
( b2 <> b3 iff dist b2,b3 <> 0 )
proof end;

theorem Th44: :: BHSP_1:44
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds dist b2,b3 >= 0 by Th34;

theorem Th45: :: BHSP_1:45
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds
( b2 <> b3 iff dist b2,b3 > 0 )
proof end;

theorem Th46: :: BHSP_1:46
for b1 being RealUnitarySpace
for b2, b3 being Point of b1 holds dist b2,b3 = sqrt ((b2 - b3) .|. (b2 - b3)) ;

theorem Th47: :: BHSP_1:47
for b1 being RealUnitarySpace
for b2, b3, b4, b5 being Point of b1 holds dist (b2 + b3),(b4 + b5) <= (dist b2,b4) + (dist b3,b5)
proof end;

theorem Th48: :: BHSP_1:48
for b1 being RealUnitarySpace
for b2, b3, b4, b5 being Point of b1 holds dist (b2 - b3),(b4 - b5) <= (dist b2,b4) + (dist b3,b5)
proof end;

theorem Th49: :: BHSP_1:49
for b1 being RealUnitarySpace
for b2, b3, b4 being Point of b1 holds dist (b2 - b3),(b4 - b3) = dist b2,b4
proof end;

theorem Th50: :: BHSP_1:50
for b1 being RealUnitarySpace
for b2, b3, b4 being Point of b1 holds dist (b2 - b3),(b4 - b3) <= (dist b3,b2) + (dist b3,b4)
proof end;

definition
let c4 be RealUnitarySpace;
let c5 be sequence of c4;
canceled;
canceled;
canceled;
canceled;
func - c2 -> sequence of a1 means :Def10: :: BHSP_1:def 10
for b1 being Nat holds a3 . b1 = - (a2 . b1);
existence
ex b1 being sequence of c4 st
for b2 being Nat holds b1 . b2 = - (c5 . b2)
proof end;
uniqueness
for b1, b2 being sequence of c4 st ( for b3 being Nat holds b1 . b3 = - (c5 . b3) ) & ( for b3 being Nat holds b2 . b3 = - (c5 . b3) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def6 BHSP_1:def 6 :
canceled;

:: deftheorem Def7 BHSP_1:def 7 :
canceled;

:: deftheorem Def8 BHSP_1:def 8 :
canceled;

:: deftheorem Def9 BHSP_1:def 9 :
canceled;

:: deftheorem Def10 defines - BHSP_1:def 10 :
for b1 being RealUnitarySpace
for b2, b3 being sequence of b1 holds
( b3 = - b2 iff for b4 being Nat holds b3 . b4 = - (b2 . b4) );

definition
let c4 be RealUnitarySpace;
let c5 be sequence of c4;
let c6 be Point of c4;
canceled;
func c2 + c3 -> sequence of a1 means :Def12: :: BHSP_1:def 12
for b1 being Nat holds a4 . b1 = (a2 . b1) + a3;
existence
ex b1 being sequence of c4 st
for b2 being Nat holds b1 . b2 = (c5 . b2) + c6
proof end;
uniqueness
for b1, b2 being sequence of c4 st ( for b3 being Nat holds b1 . b3 = (c5 . b3) + c6 ) & ( for b3 being Nat holds b2 . b3 = (c5 . b3) + c6 ) holds
b1 = b2
proof end;
end;

:: deftheorem Def11 BHSP_1:def 11 :
canceled;

:: deftheorem Def12 defines + BHSP_1:def 12 :
for b1 being RealUnitarySpace
for b2 being sequence of b1
for b3 being Point of b1
for b4 being sequence of b1 holds
( b4 = b2 + b3 iff for b5 being Nat holds b4 . b5 = (b2 . b5) + b3 );

theorem Th51: :: BHSP_1:51
canceled;

theorem Th52: :: BHSP_1:52
canceled;

theorem Th53: :: BHSP_1:53
canceled;

theorem Th54: :: BHSP_1:54
canceled;

theorem Th55: :: BHSP_1:55
for b1 being RealUnitarySpace
for b2, b3 being sequence of b1 holds b2 + b3 = b3 + b2
proof end;

definition
let c4 be RealUnitarySpace;
let c5, c6 be sequence of c4;
redefine func + as c2 + c3 -> M6( NAT ,the carrier of a1);
commutativity
for b1, b2 being sequence of c4 holds b1 + b2 = b2 + b1
by Th55;
end;

theorem Th56: :: BHSP_1:56
for b1 being RealUnitarySpace
for b2, b3, b4 being sequence of b1 holds b2 + (b3 + b4) = (b2 + b3) + b4
proof end;

theorem Th57: :: BHSP_1:57
for b1 being RealUnitarySpace
for b2, b3, b4 being sequence of b1 st b2 is V45 & b3 is V45 & b4 = b2 + b3 holds
b4 is V45
proof end;

theorem Th58: :: BHSP_1:58
for b1 being RealUnitarySpace
for b2, b3, b4 being sequence of b1 st b2 is V45 & b3 is V45 & b4 = b2 - b3 holds
b4 is V45
proof end;

theorem Th59: :: BHSP_1:59
for b1 being Real
for b2 being RealUnitarySpace
for b3, b4 being sequence of b2 st b3 is V45 & b4 = b1 * b3 holds
b4 is V45
proof end;

theorem Th60: :: BHSP_1:60
canceled;

theorem Th61: :: BHSP_1:61
canceled;

theorem Th62: :: BHSP_1:62
canceled;

theorem Th63: :: BHSP_1:63
canceled;

theorem Th64: :: BHSP_1:64
canceled;

theorem Th65: :: BHSP_1:65
canceled;

theorem Th66: :: BHSP_1:66
canceled;

theorem Th67: :: BHSP_1:67
canceled;

theorem Th68: :: BHSP_1:68
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds
( b2 is V45 iff for b3 being Nat holds b2 . b3 = b2 . (b3 + 1) )
proof end;

theorem Th69: :: BHSP_1:69
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds
( b2 is V45 iff for b3, b4 being Nat holds b2 . b3 = b2 . (b3 + b4) )
proof end;

theorem Th70: :: BHSP_1:70
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds
( b2 is V45 iff for b3, b4 being Nat holds b2 . b3 = b2 . b4 )
proof end;

theorem Th71: :: BHSP_1:71
for b1 being RealUnitarySpace
for b2, b3 being sequence of b1 holds b2 - b3 = b2 + (- b3)
proof end;

theorem Th72: :: BHSP_1:72
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds b2 = b2 + (0. b1)
proof end;

theorem Th73: :: BHSP_1:73
for b1 being Real
for b2 being RealUnitarySpace
for b3, b4 being sequence of b2 holds b1 * (b3 + b4) = (b1 * b3) + (b1 * b4)
proof end;

theorem Th74: :: BHSP_1:74
for b1, b2 being Real
for b3 being RealUnitarySpace
for b4 being sequence of b3 holds (b1 + b2) * b4 = (b1 * b4) + (b2 * b4)
proof end;

theorem Th75: :: BHSP_1:75
for b1, b2 being Real
for b3 being RealUnitarySpace
for b4 being sequence of b3 holds (b1 * b2) * b4 = b1 * (b2 * b4)
proof end;

theorem Th76: :: BHSP_1:76
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds 1 * b2 = b2
proof end;

theorem Th77: :: BHSP_1:77
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds (- 1) * b2 = - b2
proof end;

theorem Th78: :: BHSP_1:78
for b1 being RealUnitarySpace
for b2 being Point of b1
for b3 being sequence of b1 holds b3 - b2 = b3 + (- b2)
proof end;

theorem Th79: :: BHSP_1:79
for b1 being RealUnitarySpace
for b2, b3 being sequence of b1 holds b2 - b3 = - (b3 - b2)
proof end;

theorem Th80: :: BHSP_1:80
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds b2 = b2 - (0. b1)
proof end;

theorem Th81: :: BHSP_1:81
for b1 being RealUnitarySpace
for b2 being sequence of b1 holds b2 = - (- b2)
proof end;

theorem Th82: :: BHSP_1:82
for b1 being RealUnitarySpace
for b2, b3, b4 being sequence of b1 holds b2 - (b3 + b4) = (b2 - b3) - b4
proof end;

theorem Th83: :: BHSP_1:83
for b1 being RealUnitarySpace
for b2, b3, b4 being sequence of b1 holds (b2 + b3) - b4 = b2 + (b3 - b4)
proof end;

theorem Th84: :: BHSP_1:84
for b1 being RealUnitarySpace
for b2, b3, b4 being sequence of b1 holds b2 - (b3 - b4) = (b2 - b3) + b4
proof end;

theorem Th85: :: BHSP_1:85
for b1 being Real
for b2 being RealUnitarySpace
for b3, b4 being sequence of b2 holds b1 * (b3 - b4) = (b1 * b3) - (b1 * b4)
proof end;