:: ANALORT semantic presentation

definition
let c1 be non empty Abelian LoopStr ;
let c2, c3 be Element of c1;
redefine func + as c2 + c3 -> M3(the carrier of a1);
commutativity
for b1, b2 being Element of c1 holds b1 + b2 = b2 + b1
by RLVECT_1:def 5;
end;

Lemma1: for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1
for b6, b7, b8, b9 being Real st b2 = (b6 * b3) + (b7 * b4) & b5 = (b8 * b3) + (b9 * b4) holds
( b2 + b5 = ((b6 + b8) * b3) + ((b7 + b9) * b4) & b2 - b5 = ((b6 - b8) * b3) + ((b7 - b9) * b4) )
proof end;

Lemma2: for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1
for b5, b6, b7 being Real st b2 = (b5 * b3) + (b6 * b4) holds
b7 * b2 = ((b7 * b5) * b3) + ((b7 * b6) * b4)
proof end;

Lemma3: for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1
for b4, b5, b6, b7 being Real st Gen b2,b3 & (b4 * b2) + (b5 * b3) = (b6 * b2) + (b7 * b3) holds
( b4 = b6 & b5 = b7 )
proof end;

Lemma4: for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
( b2 <> 0. b1 & b3 <> 0. b1 )
proof end;

Lemma5: for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
b4 = ((pr1 b2,b3,b4) * b2) + ((pr2 b2,b3,b4) * b3)
proof end;

Lemma6: for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1
for b5, b6 being Real st Gen b2,b3 & b4 = (b5 * b2) + (b6 * b3) holds
( b5 = pr1 b2,b3,b4 & b6 = pr2 b2,b3,b4 )
proof end;

Lemma7: for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1
for b6 being Real st Gen b2,b3 holds
( pr1 b2,b3,(b4 + b5) = (pr1 b2,b3,b4) + (pr1 b2,b3,b5) & pr2 b2,b3,(b4 + b5) = (pr2 b2,b3,b4) + (pr2 b2,b3,b5) & pr1 b2,b3,(b4 - b5) = (pr1 b2,b3,b4) - (pr1 b2,b3,b5) & pr2 b2,b3,(b4 - b5) = (pr2 b2,b3,b4) - (pr2 b2,b3,b5) & pr1 b2,b3,(b6 * b4) = b6 * (pr1 b2,b3,b4) & pr2 b2,b3,(b6 * b4) = b6 * (pr2 b2,b3,b4) )
proof end;

definition
let c1 be RealLinearSpace;
let c2, c3, c4 be VECTOR of c1;
func Ortm c2,c3,c4 -> VECTOR of a1 equals :: ANALORT:def 1
((pr1 a2,a3,a4) * a2) + ((- (pr2 a2,a3,a4)) * a3);
correctness
coherence
((pr1 c2,c3,c4) * c2) + ((- (pr2 c2,c3,c4)) * c3) is VECTOR of c1
;
;
end;

:: deftheorem Def1 defines Ortm ANALORT:def 1 :
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 holds Ortm b2,b3,b4 = ((pr1 b2,b3,b4) * b2) + ((- (pr2 b2,b3,b4)) * b3);

theorem Th1: :: ANALORT:1
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 holds
Ortm b2,b3,(b4 + b5) = (Ortm b2,b3,b4) + (Ortm b2,b3,b5)
proof end;

theorem Th2: :: ANALORT:2
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1
for b5 being Real st Gen b2,b3 holds
Ortm b2,b3,(b5 * b4) = b5 * (Ortm b2,b3,b4)
proof end;

theorem Th3: :: ANALORT:3
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
Ortm b2,b3,(0. b1) = 0. b1
proof end;

theorem Th4: :: ANALORT:4
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
Ortm b2,b3,(- b4) = - (Ortm b2,b3,b4)
proof end;

theorem Th5: :: ANALORT:5
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 holds
Ortm b2,b3,(b4 - b5) = (Ortm b2,b3,b4) - (Ortm b2,b3,b5)
proof end;

theorem Th6: :: ANALORT:6
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 & Ortm b2,b3,b4 = Ortm b2,b3,b5 holds
b4 = b5
proof end;

theorem Th7: :: ANALORT:7
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
Ortm b2,b3,(Ortm b2,b3,b4) = b4
proof end;

theorem Th8: :: ANALORT:8
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
ex b5 being VECTOR of b1 st b4 = Ortm b2,b3,b5
proof end;

definition
let c1 be RealLinearSpace;
let c2, c3, c4 be VECTOR of c1;
func Orte c2,c3,c4 -> VECTOR of a1 equals :: ANALORT:def 2
((pr2 a2,a3,a4) * a2) + ((- (pr1 a2,a3,a4)) * a3);
correctness
coherence
((pr2 c2,c3,c4) * c2) + ((- (pr1 c2,c3,c4)) * c3) is VECTOR of c1
;
;
end;

:: deftheorem Def2 defines Orte ANALORT:def 2 :
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 holds Orte b2,b3,b4 = ((pr2 b2,b3,b4) * b2) + ((- (pr1 b2,b3,b4)) * b3);

theorem Th9: :: ANALORT:9
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
Orte b2,b3,(- b4) = - (Orte b2,b3,b4)
proof end;

theorem Th10: :: ANALORT:10
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 holds
Orte b2,b3,(b4 + b5) = (Orte b2,b3,b4) + (Orte b2,b3,b5)
proof end;

theorem Th11: :: ANALORT:11
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 holds
Orte b2,b3,(b4 - b5) = (Orte b2,b3,b4) - (Orte b2,b3,b5)
proof end;

theorem Th12: :: ANALORT:12
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1
for b5 being Real st Gen b2,b3 holds
Orte b2,b3,(b5 * b4) = b5 * (Orte b2,b3,b4)
proof end;

theorem Th13: :: ANALORT:13
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 & Orte b2,b3,b4 = Orte b2,b3,b5 holds
b4 = b5
proof end;

theorem Th14: :: ANALORT:14
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
Orte b2,b3,(Orte b2,b3,b4) = - b4
proof end;

theorem Th15: :: ANALORT:15
for b1 being RealLinearSpace
for b2, b3, b4 being VECTOR of b1 st Gen b2,b3 holds
ex b5 being VECTOR of b1 st Orte b2,b3,b5 = b4
proof end;

definition
let c1 be RealLinearSpace;
let c2, c3, c4, c5, c6, c7 be VECTOR of c1;
pred c4,c5,c6,c7 are_COrte_wrt c2,c3 means :Def3: :: ANALORT:def 3
Orte a2,a3,a4, Orte a2,a3,a5 // a6,a7;
pred c4,c5,c6,c7 are_COrtm_wrt c2,c3 means :Def4: :: ANALORT:def 4
Ortm a2,a3,a4, Ortm a2,a3,a5 // a6,a7;
end;

:: deftheorem Def3 defines are_COrte_wrt ANALORT:def 3 :
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 holds
( b4,b5,b6,b7 are_COrte_wrt b2,b3 iff Orte b2,b3,b4, Orte b2,b3,b5 // b6,b7 );

:: deftheorem Def4 defines are_COrtm_wrt ANALORT:def 4 :
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 holds
( b4,b5,b6,b7 are_COrtm_wrt b2,b3 iff Ortm b2,b3,b4, Ortm b2,b3,b5 // b6,b7 );

theorem Th16: :: ANALORT:16
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 & b4,b5 // b6,b7 holds
Orte b2,b3,b4, Orte b2,b3,b5 // Orte b2,b3,b6, Orte b2,b3,b7
proof end;

theorem Th17: :: ANALORT:17
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 & b4,b5 // b6,b7 holds
Ortm b2,b3,b4, Ortm b2,b3,b5 // Ortm b2,b3,b6, Ortm b2,b3,b7
proof end;

theorem Th18: :: ANALORT:18
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 holds
b6,b7,b5,b4 are_COrte_wrt b2,b3
proof end;

theorem Th19: :: ANALORT:19
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 holds
b6,b7,b4,b5 are_COrtm_wrt b2,b3
proof end;

theorem Th20: :: ANALORT:20
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6 being VECTOR of b1 holds b2,b2,b3,b4 are_COrte_wrt b5,b6
proof end;

theorem Th21: :: ANALORT:21
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6 being VECTOR of b1 holds b2,b2,b3,b4 are_COrtm_wrt b5,b6
proof end;

theorem Th22: :: ANALORT:22
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6 being VECTOR of b1 holds b2,b3,b4,b4 are_COrte_wrt b5,b6
proof end;

theorem Th23: :: ANALORT:23
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6 being VECTOR of b1 holds b2,b3,b4,b4 are_COrtm_wrt b5,b6
proof end;

theorem Th24: :: ANALORT:24
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 st Gen b2,b3 holds
b4,b5, Orte b2,b3,b4, Orte b2,b3,b5 are_Ort_wrt b2,b3
proof end;

theorem Th25: :: ANALORT:25
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 holds b2,b3, Orte b4,b5,b2, Orte b4,b5,b3 are_COrte_wrt b4,b5
proof end;

theorem Th26: :: ANALORT:26
for b1 being RealLinearSpace
for b2, b3, b4, b5 being VECTOR of b1 holds b2,b3, Ortm b4,b5,b2, Ortm b4,b5,b3 are_COrtm_wrt b4,b5
proof end;

theorem Th27: :: ANALORT:27
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 holds
( b4,b5 // b6,b7 iff ex b8, b9 being VECTOR of b1 st
( b8 <> b9 & b8,b9,b4,b5 are_COrte_wrt b2,b3 & b8,b9,b6,b7 are_COrte_wrt b2,b3 ) )
proof end;

theorem Th28: :: ANALORT:28
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 holds
( b4,b5 // b6,b7 iff ex b8, b9 being VECTOR of b1 st
( b8 <> b9 & b8,b9,b4,b5 are_COrtm_wrt b2,b3 & b8,b9,b6,b7 are_COrtm_wrt b2,b3 ) )
proof end;

theorem Th29: :: ANALORT:29
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 holds
( b4,b5,b6,b7 are_Ort_wrt b2,b3 iff ( b4,b5,b6,b7 are_COrte_wrt b2,b3 or b4,b5,b7,b6 are_COrte_wrt b2,b3 ) )
proof end;

theorem Th30: :: ANALORT:30
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 & b4,b5,b7,b6 are_COrte_wrt b2,b3 & not b4 = b5 holds
b6 = b7
proof end;

theorem Th31: :: ANALORT:31
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 & b4,b5,b7,b6 are_COrtm_wrt b2,b3 & not b4 = b5 holds
b6 = b7
proof end;

theorem Th32: :: ANALORT:32
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 & b4,b5,b6,b8 are_COrte_wrt b2,b3 & not b4,b5,b7,b8 are_COrte_wrt b2,b3 holds
b4,b5,b8,b7 are_COrte_wrt b2,b3
proof end;

theorem Th33: :: ANALORT:33
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 & b4,b5,b6,b8 are_COrtm_wrt b2,b3 & not b4,b5,b7,b8 are_COrtm_wrt b2,b3 holds
b4,b5,b8,b7 are_COrtm_wrt b2,b3
proof end;

theorem Th34: :: ANALORT:34
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st b2,b3,b4,b5 are_COrte_wrt b6,b7 holds
b3,b2,b5,b4 are_COrte_wrt b6,b7
proof end;

theorem Th35: :: ANALORT:35
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1 st b2,b3,b4,b5 are_COrtm_wrt b6,b7 holds
b3,b2,b5,b4 are_COrtm_wrt b6,b7
proof end;

theorem Th36: :: ANALORT:36
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 & b4,b5,b7,b8 are_COrte_wrt b2,b3 holds
b4,b5,b6,b8 are_COrte_wrt b2,b3
proof end;

theorem Th37: :: ANALORT:37
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 & b4,b5,b7,b8 are_COrtm_wrt b2,b3 holds
b4,b5,b6,b8 are_COrtm_wrt b2,b3
proof end;

theorem Th38: :: ANALORT:38
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
for b4, b5, b6 being VECTOR of b1 ex b7 being VECTOR of b1 st
( b6 <> b7 & b6,b7,b4,b5 are_COrte_wrt b2,b3 )
proof end;

theorem Th39: :: ANALORT:39
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
for b4, b5, b6 being VECTOR of b1 ex b7 being VECTOR of b1 st
( b6 <> b7 & b6,b7,b4,b5 are_COrtm_wrt b2,b3 )
proof end;

theorem Th40: :: ANALORT:40
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
for b4, b5, b6 being VECTOR of b1 ex b7 being VECTOR of b1 st
( b6 <> b7 & b4,b5,b6,b7 are_COrte_wrt b2,b3 )
proof end;

theorem Th41: :: ANALORT:41
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
for b4, b5, b6 being VECTOR of b1 ex b7 being VECTOR of b1 st
( b6 <> b7 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 )
proof end;

theorem Th42: :: ANALORT:42
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8, b9, b10, b11 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 & b8,b9,b6,b7 are_COrte_wrt b2,b3 & b8,b9,b10,b11 are_COrte_wrt b2,b3 & not b8 = b9 & not b6 = b7 holds
b4,b5,b10,b11 are_COrte_wrt b2,b3
proof end;

theorem Th43: :: ANALORT:43
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8, b9, b10, b11 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 & b8,b9,b6,b7 are_COrtm_wrt b2,b3 & b8,b9,b10,b11 are_COrtm_wrt b2,b3 & not b8 = b9 & not b6 = b7 holds
b4,b5,b10,b11 are_COrtm_wrt b2,b3
proof end;

theorem Th44: :: ANALORT:44
canceled;

theorem Th45: :: ANALORT:45
canceled;

theorem Th46: :: ANALORT:46
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8, b9, b10, b11 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 & b6,b7,b8,b9 are_COrte_wrt b2,b3 & b10,b11,b8,b9 are_COrte_wrt b2,b3 & not b4,b5,b10,b11 are_COrte_wrt b2,b3 & not b6 = b7 holds
b8 = b9
proof end;

theorem Th47: :: ANALORT:47
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8, b9, b10, b11 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 & b6,b7,b8,b9 are_COrtm_wrt b2,b3 & b10,b11,b8,b9 are_COrtm_wrt b2,b3 & not b4,b5,b10,b11 are_COrtm_wrt b2,b3 & not b6 = b7 holds
b8 = b9
proof end;

theorem Th48: :: ANALORT:48
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8, b9, b10, b11 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrte_wrt b2,b3 & b6,b7,b8,b9 are_COrte_wrt b2,b3 & b4,b5,b10,b11 are_COrte_wrt b2,b3 & not b10,b11,b8,b9 are_COrte_wrt b2,b3 & not b6 = b7 holds
b4 = b5
proof end;

theorem Th49: :: ANALORT:49
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7, b8, b9, b10, b11 being VECTOR of b1 st Gen b2,b3 & b4,b5,b6,b7 are_COrtm_wrt b2,b3 & b6,b7,b8,b9 are_COrtm_wrt b2,b3 & b4,b5,b10,b11 are_COrtm_wrt b2,b3 & not b10,b11,b8,b9 are_COrtm_wrt b2,b3 & not b6 = b7 holds
b4 = b5
proof end;

theorem Th50: :: ANALORT:50
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
for b4, b5, b6, b7, b8 being VECTOR of b1 st not b4,b7,b5,b6 are_COrte_wrt b2,b3 & not b4,b7,b6,b5 are_COrte_wrt b2,b3 & b6,b8,b6,b5 are_COrte_wrt b2,b3 holds
ex b9 being VECTOR of b1 st
( ( b4,b7,b4,b9 are_COrte_wrt b2,b3 or b4,b7,b9,b4 are_COrte_wrt b2,b3 ) & ( b6,b8,b6,b9 are_COrte_wrt b2,b3 or b6,b8,b9,b6 are_COrte_wrt b2,b3 ) )
proof end;

theorem Th51: :: ANALORT:51
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
ex b4, b5, b6 being VECTOR of b1 st
( b4,b5,b4,b6 are_COrte_wrt b2,b3 & ( for b7, b8 being VECTOR of b1 holds
( not b7,b8,b4,b5 are_COrte_wrt b2,b3 or ( not b7,b8,b4,b6 are_COrte_wrt b2,b3 & not b7,b8,b6,b4 are_COrte_wrt b2,b3 ) or b7 = b8 ) ) )
proof end;

theorem Th52: :: ANALORT:52
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
for b4, b5, b6, b7, b8 being VECTOR of b1 st not b4,b7,b5,b6 are_COrtm_wrt b2,b3 & not b4,b7,b6,b5 are_COrtm_wrt b2,b3 & b6,b8,b6,b5 are_COrtm_wrt b2,b3 holds
ex b9 being VECTOR of b1 st
( ( b4,b7,b4,b9 are_COrtm_wrt b2,b3 or b4,b7,b9,b4 are_COrtm_wrt b2,b3 ) & ( b6,b8,b6,b9 are_COrtm_wrt b2,b3 or b6,b8,b9,b6 are_COrtm_wrt b2,b3 ) )
proof end;

theorem Th53: :: ANALORT:53
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 st Gen b2,b3 holds
ex b4, b5, b6 being VECTOR of b1 st
( b4,b5,b4,b6 are_COrtm_wrt b2,b3 & ( for b7, b8 being VECTOR of b1 holds
( not b7,b8,b4,b5 are_COrtm_wrt b2,b3 or ( not b7,b8,b4,b6 are_COrtm_wrt b2,b3 & not b7,b8,b6,b4 are_COrtm_wrt b2,b3 ) or b7 = b8 ) ) )
proof end;

definition
let c1 be RealLinearSpace;
let c2, c3 be VECTOR of c1;
func CORTE c1,c2,c3 -> Relation of [:the carrier of a1,the carrier of a1:] means :Def5: :: ANALORT:def 5
for b1, b2 being set holds
( [b1,b2] in a4 iff ex b3, b4, b5, b6 being VECTOR of a1 st
( b1 = [b3,b4] & b2 = [b5,b6] & b3,b4,b5,b6 are_COrte_wrt a2,a3 ) );
existence
ex b1 being Relation of [:the carrier of c1,the carrier of c1:] st
for b2, b3 being set holds
( [b2,b3] in b1 iff ex b4, b5, b6, b7 being VECTOR of c1 st
( b2 = [b4,b5] & b3 = [b6,b7] & b4,b5,b6,b7 are_COrte_wrt c2,c3 ) )
proof end;
uniqueness
for b1, b2 being Relation of [:the carrier of c1,the carrier of c1:] st ( for b3, b4 being set holds
( [b3,b4] in b1 iff ex b5, b6, b7, b8 being VECTOR of c1 st
( b3 = [b5,b6] & b4 = [b7,b8] & b5,b6,b7,b8 are_COrte_wrt c2,c3 ) ) ) & ( for b3, b4 being set holds
( [b3,b4] in b2 iff ex b5, b6, b7, b8 being VECTOR of c1 st
( b3 = [b5,b6] & b4 = [b7,b8] & b5,b6,b7,b8 are_COrte_wrt c2,c3 ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def5 defines CORTE ANALORT:def 5 :
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1
for b4 being Relation of [:the carrier of b1,the carrier of b1:] holds
( b4 = CORTE b1,b2,b3 iff for b5, b6 being set holds
( [b5,b6] in b4 iff ex b7, b8, b9, b10 being VECTOR of b1 st
( b5 = [b7,b8] & b6 = [b9,b10] & b7,b8,b9,b10 are_COrte_wrt b2,b3 ) ) );

definition
let c1 be RealLinearSpace;
let c2, c3 be VECTOR of c1;
func CORTM c1,c2,c3 -> Relation of [:the carrier of a1,the carrier of a1:] means :Def6: :: ANALORT:def 6
for b1, b2 being set holds
( [b1,b2] in a4 iff ex b3, b4, b5, b6 being VECTOR of a1 st
( b1 = [b3,b4] & b2 = [b5,b6] & b3,b4,b5,b6 are_COrtm_wrt a2,a3 ) );
existence
ex b1 being Relation of [:the carrier of c1,the carrier of c1:] st
for b2, b3 being set holds
( [b2,b3] in b1 iff ex b4, b5, b6, b7 being VECTOR of c1 st
( b2 = [b4,b5] & b3 = [b6,b7] & b4,b5,b6,b7 are_COrtm_wrt c2,c3 ) )
proof end;
uniqueness
for b1, b2 being Relation of [:the carrier of c1,the carrier of c1:] st ( for b3, b4 being set holds
( [b3,b4] in b1 iff ex b5, b6, b7, b8 being VECTOR of c1 st
( b3 = [b5,b6] & b4 = [b7,b8] & b5,b6,b7,b8 are_COrtm_wrt c2,c3 ) ) ) & ( for b3, b4 being set holds
( [b3,b4] in b2 iff ex b5, b6, b7, b8 being VECTOR of c1 st
( b3 = [b5,b6] & b4 = [b7,b8] & b5,b6,b7,b8 are_COrtm_wrt c2,c3 ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def6 defines CORTM ANALORT:def 6 :
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1
for b4 being Relation of [:the carrier of b1,the carrier of b1:] holds
( b4 = CORTM b1,b2,b3 iff for b5, b6 being set holds
( [b5,b6] in b4 iff ex b7, b8, b9, b10 being VECTOR of b1 st
( b5 = [b7,b8] & b6 = [b9,b10] & b7,b8,b9,b10 are_COrtm_wrt b2,b3 ) ) );

definition
let c1 be RealLinearSpace;
let c2, c3 be VECTOR of c1;
func CESpace c1,c2,c3 -> strict AffinStruct equals :: ANALORT:def 7
AffinStruct(# the carrier of a1,(CORTE a1,a2,a3) #);
correctness
coherence
AffinStruct(# the carrier of c1,(CORTE c1,c2,c3) #) is strict AffinStruct
;
;
end;

:: deftheorem Def7 defines CESpace ANALORT:def 7 :
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 holds CESpace b1,b2,b3 = AffinStruct(# the carrier of b1,(CORTE b1,b2,b3) #);

registration
let c1 be RealLinearSpace;
let c2, c3 be VECTOR of c1;
cluster CESpace a1,a2,a3 -> non empty strict ;
coherence
not CESpace c1,c2,c3 is empty
proof end;
end;

definition
let c1 be RealLinearSpace;
let c2, c3 be VECTOR of c1;
func CMSpace c1,c2,c3 -> strict AffinStruct equals :: ANALORT:def 8
AffinStruct(# the carrier of a1,(CORTM a1,a2,a3) #);
correctness
coherence
AffinStruct(# the carrier of c1,(CORTM c1,c2,c3) #) is strict AffinStruct
;
;
end;

:: deftheorem Def8 defines CMSpace ANALORT:def 8 :
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1 holds CMSpace b1,b2,b3 = AffinStruct(# the carrier of b1,(CORTM b1,b2,b3) #);

registration
let c1 be RealLinearSpace;
let c2, c3 be VECTOR of c1;
cluster CMSpace a1,a2,a3 -> non empty strict ;
coherence
not CMSpace c1,c2,c3 is empty
proof end;
end;

theorem Th54: :: ANALORT:54
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1
for b4 being set holds
( b4 is Element of (CESpace b1,b2,b3) iff b4 is VECTOR of b1 ) ;

theorem Th55: :: ANALORT:55
for b1 being RealLinearSpace
for b2, b3 being VECTOR of b1
for b4 being set holds
( b4 is Element of (CMSpace b1,b2,b3) iff b4 is VECTOR of b1 ) ;

theorem Th56: :: ANALORT:56
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1
for b8, b9, b10, b11 being Element of (CESpace b1,b6,b7) st b2 = b8 & b3 = b9 & b4 = b10 & b5 = b11 holds
( b8,b9 // b10,b11 iff b2,b3,b4,b5 are_COrte_wrt b6,b7 )
proof end;

theorem Th57: :: ANALORT:57
for b1 being RealLinearSpace
for b2, b3, b4, b5, b6, b7 being VECTOR of b1
for b8, b9, b10, b11 being Element of (CMSpace b1,b6,b7) st b2 = b8 & b3 = b9 & b4 = b10 & b5 = b11 holds
( b8,b9 // b10,b11 iff b2,b3,b4,b5 are_COrtm_wrt b6,b7 )
proof end;