:: A Construction of an Abstract Space of Congruence of Vectors
:: by Grzegorz Lewandowski and Krzysztof Pra\.zmowski
::
:: Received May 23, 1990
:: Copyright (c) 1990-2011 Association of Mizar Users

begin

theorem :: TDGROUP:1

canceled;

theorem Th2: :: TDGROUP:2

for a being Element of G_Real ex b being Element of G_Real st b + b = a

proof end;

theorem :: TDGROUP:3

for a being Element of G_Real st a + a = 0. G_Real holds
a = 0. G_Real ;

definition

let IT be non empty addLoopStr ;
attr IT is Two_Divisible means :Def1: :: TDGROUP:def 1
for a being Element of IT ex b being Element of IT st b + b = a;

end;

:: deftheorem Def1 defines Two_Divisible TDGROUP:def 1 :
for IT being non empty addLoopStr holds
( IT is Two_Divisible iff for a being Element of IT ex b being Element of IT st b + b = a );

Lm1: G_Real is Fanoian

proof end;

registration

cluster G_Real -> Fanoian Two_Divisible ;
coherence
( G_Real is Fanoian & G_Real is Two_Divisible ) by Def1, Lm1, Th2;

end;

registration

cluster non empty strict right_complementable Abelian add-associative right_zeroed Fanoian Two_Divisible addLoopStr ;
existence
ex b₁ being non empty addLoopStr st
( b₁ is strict & b₁ is Fanoian & b₁ is Two_Divisible & b₁ is add-associative & b₁ is right_zeroed & b₁ is right_complementable & b₁ is Abelian ) by Lm1;

end;

definition

mode Two_Divisible_Group is non empty right_complementable Abelian add-associative right_zeroed Two_Divisible addLoopStr ;

end;

definition

mode Uniquely_Two_Divisible_Group is non empty right_complementable Abelian add-associative right_zeroed Fanoian Two_Divisible addLoopStr ;

end;

theorem :: TDGROUP:4

canceled;

theorem :: TDGROUP:5

canceled;

theorem :: TDGROUP:6

canceled;

theorem :: TDGROUP:7

for AG being non empty right_complementable Abelian add-associative right_zeroed addLoopStr holds
( AG is Uniquely_Two_Divisible_Group iff ( ( for a being Element of AG ex b being Element of AG st b + b = a ) & ( for a being Element of AG st a + a = 0. AG holds
a = 0. AG ) ) ) by Def1, VECTSP_1:def 30;

notation

let ADG be non empty addLoopStr ;
let a, b be Element of ADG;
synonym a # b for a + b;

end;

definition

let ADG be non empty addLoopStr ;
canceled;
canceled;
func CONGRD ADG -> Relation of [: the carrier of ADG, the carrier of ADG:] means :Def4: :: TDGROUP:def 4
for a, b, c, d being Element of ADG holds
( [[a,b],[c,d]] in it iff a # d = b # c );
existence
ex b₁ being Relation of [: the carrier of ADG, the carrier of ADG:] st
for a, b, c, d being Element of ADG holds
( [[a,b],[c,d]] in b₁ iff a # d = b # c )

proof end;

uniqueness
for b₁, b₂ being Relation of [: the carrier of ADG, the carrier of ADG:] st ( for a, b, c, d being Element of ADG holds
( [[a,b],[c,d]] in b₁ iff a # d = b # c ) ) & ( for a, b, c, d being Element of ADG holds
( [[a,b],[c,d]] in b₂ iff a # d = b # c ) ) holds
b₁ = b₂

proof end;

end;

:: deftheorem TDGROUP:def 2 :
canceled;

:: deftheorem TDGROUP:def 3 :
canceled;

:: deftheorem Def4 defines CONGRD TDGROUP:def 4 :
for ADG being non empty addLoopStr
for b₂ being Relation of [: the carrier of ADG, the carrier of ADG:] holds
( b₂ = CONGRD ADG iff for a, b, c, d being Element of ADG holds
( [[a,b],[c,d]] in b₂ iff a # d = b # c ) );

definition

let ADG be non empty addLoopStr ;
func AV ADG -> strict AffinStruct equals :: TDGROUP:def 5
AffinStruct(# the carrier of ADG,(CONGRD ADG) #);
coherence
AffinStruct(# the carrier of ADG,(CONGRD ADG) #) is strict AffinStruct ;

end;

:: deftheorem defines AV TDGROUP:def 5 :
for ADG being non empty addLoopStr holds AV ADG = AffinStruct(# the carrier of ADG,(CONGRD ADG) #);

registration

let ADG be non empty addLoopStr ;
cluster AV ADG -> non empty strict ;
coherence
not AV ADG is empty ;

end;

theorem :: TDGROUP:8

canceled;

theorem :: TDGROUP:9

for ADG being Uniquely_Two_Divisible_Group holds
( the carrier of (AV ADG) = the carrier of ADG & the CONGR of (AV ADG) = CONGRD ADG ) ;

definition

let ADG be Uniquely_Two_Divisible_Group;
let a, b, c, d be Element of ADG;
pred a,b ==> c,d means :Def6: :: TDGROUP:def 6
[[a,b],[c,d]] in the CONGR of (AV ADG);

end;

:: deftheorem Def6 defines ==> TDGROUP:def 6 :
for ADG being Uniquely_Two_Divisible_Group
for a, b, c, d being Element of ADG holds
( a,b ==> c,d iff [[a,b],[c,d]] in the CONGR of (AV ADG) );

theorem Th10: :: TDGROUP:10

for ADG being Uniquely_Two_Divisible_Group
for a, b, c, d being Element of ADG holds
( a,b ==> c,d iff a # d = b # c )

proof end;

theorem Th11: :: TDGROUP:11

ex a, b being Element of G_Real st a <> b

proof end;

theorem :: TDGROUP:12

ex ADG being Uniquely_Two_Divisible_Group ex a, b being Element of ADG st a <> b by Th11;

theorem Th13: :: TDGROUP:13

for ADG being Uniquely_Two_Divisible_Group
for a, b, c being Element of ADG st a,b ==> c,c holds
a = b

proof end;

theorem Th14: :: TDGROUP:14

for ADG being Uniquely_Two_Divisible_Group
for a, b, p, q, c, d being Element of ADG st a,b ==> p,q & c,d ==> p,q holds
a,b ==> c,d

proof end;

theorem Th15: :: TDGROUP:15

for ADG being Uniquely_Two_Divisible_Group
for a, b, c being Element of ADG ex d being Element of ADG st a,b ==> c,d

proof end;

theorem Th16: :: TDGROUP:16

for ADG being Uniquely_Two_Divisible_Group
for a, b, a9, b9, c, c9 being Element of ADG st a,b ==> a9,b9 & a,c ==> a9,c9 holds
b,c ==> b9,c9

proof end;

theorem Th17: :: TDGROUP:17

for ADG being Uniquely_Two_Divisible_Group
for a, c being Element of ADG ex b being Element of ADG st a,b ==> b,c

proof end;

theorem Th18: :: TDGROUP:18

for ADG being Uniquely_Two_Divisible_Group
for a, b, c, b9 being Element of ADG st a,b ==> b,c & a,b9 ==> b9,c holds
b = b9

proof end;

theorem Th19: :: TDGROUP:19

for ADG being Uniquely_Two_Divisible_Group
for a, b, c, d being Element of ADG st a,b ==> c,d holds
a,c ==> b,d

proof end;

theorem Th20: :: TDGROUP:20

for ADG being Uniquely_Two_Divisible_Group st ex a, b being Element of ADG st a <> b holds
( ex a, b being Element of (AV ADG) st a <> b & ( for a, b, c being Element of (AV ADG) st a,b // c,c holds
a = b ) & ( for a, b, c, d, p, q being Element of (AV ADG) st a,b // p,q & c,d // p,q holds
a,b // c,d ) & ( for a, b, c being Element of (AV ADG) ex d being Element of (AV ADG) st a,b // c,d ) & ( for a, b, c, a9, b9, c9 being Element of (AV ADG) st a,b // a9,b9 & a,c // a9,c9 holds
b,c // b9,c9 ) & ( for a, c being Element of (AV ADG) ex b being Element of (AV ADG) st a,b // b,c ) & ( for a, b, c, b9 being Element of (AV ADG) st a,b // b,c & a,b9 // b9,c holds
b = b9 ) & ( for a, b, c, d being Element of (AV ADG) st a,b // c,d holds
a,c // b,d ) )

proof end;

definition

let IT be non empty AffinStruct ;
canceled;
attr IT is AffVect-like means :Def8: :: TDGROUP:def 8
( ( for a, b, c being Element of IT st a,b // c,c holds
a = b ) & ( for a, b, c, d, p, q being Element of IT st a,b // p,q & c,d // p,q holds
a,b // c,d ) & ( for a, b, c being Element of IT ex d being Element of IT st a,b // c,d ) & ( for a, b, c, a9, b9, c9 being Element of IT st a,b // a9,b9 & a,c // a9,c9 holds
b,c // b9,c9 ) & ( for a, c being Element of IT ex b being Element of IT st a,b // b,c ) & ( for a, b, c, b9 being Element of IT st a,b // b,c & a,b9 // b9,c holds
b = b9 ) & ( for a, b, c, d being Element of IT st a,b // c,d holds
a,c // b,d ) );

end;

:: deftheorem TDGROUP:def 7 :
canceled;

:: deftheorem Def8 defines AffVect-like TDGROUP:def 8 :
for IT being non empty AffinStruct holds
( IT is AffVect-like iff ( ( for a, b, c being Element of IT st a,b // c,c holds
a = b ) & ( for a, b, c, d, p, q being Element of IT st a,b // p,q & c,d // p,q holds
a,b // c,d ) & ( for a, b, c being Element of IT ex d being Element of IT st a,b // c,d ) & ( for a, b, c, a9, b9, c9 being Element of IT st a,b // a9,b9 & a,c // a9,c9 holds
b,c // b9,c9 ) & ( for a, c being Element of IT ex b being Element of IT st a,b // b,c ) & ( for a, b, c, b9 being Element of IT st a,b // b,c & a,b9 // b9,c holds
b = b9 ) & ( for a, b, c, d being Element of IT st a,b // c,d holds
a,c // b,d ) ) );

registration

cluster non empty non trivial strict AffVect-like AffinStruct ;
existence
ex b₁ being non empty AffinStruct st
( b₁ is strict & not b₁ is trivial & b₁ is AffVect-like )

proof end;

end;

definition

mode AffVect is non empty non trivial AffVect-like AffinStruct ;

end;

theorem :: TDGROUP:21

for AS being non empty AffinStruct holds
( ( ex a, b being Element of AS st a <> b & ( for a, b, c being Element of AS st a,b // c,c holds
a = b ) & ( for a, b, c, d, p, q being Element of AS st a,b // p,q & c,d // p,q holds
a,b // c,d ) & ( for a, b, c being Element of AS ex d being Element of AS st a,b // c,d ) & ( for a, b, c, a9, b9, c9 being Element of AS st a,b // a9,b9 & a,c // a9,c9 holds
b,c // b9,c9 ) & ( for a, c being Element of AS ex b being Element of AS st a,b // b,c ) & ( for a, b, c, b9 being Element of AS st a,b // b,c & a,b9 // b9,c holds
b = b9 ) & ( for a, b, c, d being Element of AS st a,b // c,d holds
a,c // b,d ) ) iff AS is AffVect ) by Def8, STRUCT_0:def 10;

theorem :: TDGROUP:22

for ADG being Uniquely_Two_Divisible_Group st ex a, b being Element of ADG st a <> b holds
AV ADG is AffVect

proof end;