:: BORSUK_2 semantic presentation

Lemma1: for b1 being real number holds
( ( 0 <= b1 & b1 <= 1 ) iff b1 in the carrier of I[01] )
proof end;

scheme :: BORSUK_2:sch 1
s1{ F1() -> non empty set , F2() -> set , F3( set ) -> set , P1[ set ] } :
Card { F3(b1) where B is Element of F1() : ( b1 in F2() & P1[b1] ) } <=` Card F2()
proof end;

theorem Th1: :: BORSUK_2:1
for b1, b2, b3, b4 being non empty TopSpace
for b5 being Function of b1,b2
for b6 being Function of b3,b2 st b1 is SubSpace of b4 & b3 is SubSpace of b4 & ([#] b1) \/ ([#] b3) = [#] b4 & b1 is compact & b3 is compact & b4 is_T2 & b5 is continuous & b6 is continuous & ( for b7 being set st b7 in ([#] b1) /\ ([#] b3) holds
b5 . b7 = b6 . b7 ) holds
ex b7 being Function of b4,b2 st
( b7 = b5 +* b6 & b7 is continuous )
proof end;

registration
let c1 be non empty TopStruct ;
cluster id a1 -> continuous open ;
coherence
( id c1 is open & id c1 is continuous )
proof end;
end;

registration
let c1 be non empty TopStruct ;
cluster one-to-one continuous M5(the carrier of a1,the carrier of a1);
existence
ex b1 being Function of c1,c1 st
( b1 is continuous & b1 is one-to-one )
proof end;
end;

theorem Th2: :: BORSUK_2:2
canceled;

theorem Th3: :: BORSUK_2:3
for b1, b2 being non empty TopSpace
for b3 being Function of b1,b2 st b3 is_homeomorphism holds
b3 " is open
proof end;

registration
cluster -> real Element of the carrier of I[01] ;
coherence
for b1 being Element of I[01] holds b1 is real
proof end;
end;

theorem Th4: :: BORSUK_2:4
for b1 being non empty TopSpace
for b2 being Point of b1 ex b3 being Function of I[01] ,b1 st
( b3 is continuous & b3 . 0 = b2 & b3 . 1 = b2 )
proof end;

definition
let c1 be TopStruct ;
let c2, c3 be Point of c1;
pred c2,c3 are_connected means :Def1: :: BORSUK_2:def 1
ex b1 being Function of I[01] ,a1 st
( b1 is continuous & b1 . 0 = a2 & b1 . 1 = a3 );
end;

:: deftheorem Def1 defines are_connected BORSUK_2:def 1 :
for b1 being TopStruct
for b2, b3 being Point of b1 holds
( b2,b3 are_connected iff ex b4 being Function of I[01] ,b1 st
( b4 is continuous & b4 . 0 = b2 & b4 . 1 = b3 ) );

definition
let c1 be non empty TopSpace;
let c2, c3 be Point of c1;
redefine pred are_connected as c2,c3 are_connected ;
reflexivity
for b1 being Point of c1 holds b1,b1 are_connected
proof end;
end;

definition
let c1 be TopStruct ;
let c2, c3 be Point of c1;
assume E4: c2,c3 are_connected ;
mode Path of c2,c3 -> Function of I[01] ,a1 means :Def2: :: BORSUK_2:def 2
( a4 is continuous & a4 . 0 = a2 & a4 . 1 = a3 );
existence
ex b1 being Function of I[01] ,c1 st
( b1 is continuous & b1 . 0 = c2 & b1 . 1 = c3 )
by E4, Def1;
end;

:: deftheorem Def2 defines Path BORSUK_2:def 2 :
for b1 being TopStruct
for b2, b3 being Point of b1 st b2,b3 are_connected holds
for b4 being Function of I[01] ,b1 holds
( b4 is Path of b2,b3 iff ( b4 is continuous & b4 . 0 = b2 & b4 . 1 = b3 ) );

registration
let c1 be non empty TopSpace;
let c2 be Point of c1;
cluster continuous Path of a2,a2;
existence
ex b1 being Path of c2,c2 st b1 is continuous
proof end;
end;

definition
let c1 be TopStruct ;
attr a1 is arcwise_connected means :Def3: :: BORSUK_2:def 3
for b1, b2 being Point of a1 holds b1,b2 are_connected ;
correctness
;
end;

:: deftheorem Def3 defines arcwise_connected BORSUK_2:def 3 :
for b1 being TopStruct holds
( b1 is arcwise_connected iff for b2, b3 being Point of b1 holds b2,b3 are_connected );

registration
cluster non empty arcwise_connected TopStruct ;
existence
ex b1 being TopSpace st
( b1 is arcwise_connected & not b1 is empty )
proof end;
end;

definition
let c1 be arcwise_connected TopStruct ;
let c2, c3 be Point of c1;
redefine mode Path of c2,c3 -> Function of I[01] ,a1 means :Def4: :: BORSUK_2:def 4
( a4 is continuous & a4 . 0 = a2 & a4 . 1 = a3 );
compatibility
for b1 being Function of I[01] ,c1 holds
( b1 is Path of c2,c3 iff ( b1 is continuous & b1 . 0 = c2 & b1 . 1 = c3 ) )
proof end;
end;

:: deftheorem Def4 defines Path BORSUK_2:def 4 :
for b1 being arcwise_connected TopStruct
for b2, b3 being Point of b1
for b4 being Function of I[01] ,b1 holds
( b4 is Path of b2,b3 iff ( b4 is continuous & b4 . 0 = b2 & b4 . 1 = b3 ) );

registration
let c1 be arcwise_connected TopStruct ;
let c2, c3 be Point of c1;
cluster -> continuous Path of a2,a3;
coherence
for b1 being Path of c2,c3 holds b1 is continuous
by Def4;
end;

Lemma7: ( 0 in [.0,1.] & 1 in [.0,1.] )
proof end;

theorem Th5: :: BORSUK_2:5
for b1 being non empty TopSpace st b1 is arcwise_connected holds
b1 is connected
proof end;

registration
cluster non empty arcwise_connected -> non empty connected TopStruct ;
coherence
for b1 being non empty TopSpace st b1 is arcwise_connected holds
b1 is connected
by Th5;
end;

definition
let c1 be non empty TopSpace;
let c2, c3, c4 be Point of c1;
let c5 be Path of c2,c3;
let c6 be Path of c3,c4;
assume that
E9: c2,c3 are_connected and
E10: c3,c4 are_connected ;
func c5 + c6 -> Path of a2,a4 means :Def5: :: BORSUK_2:def 5
for b1 being Point of I[01] holds
( ( b1 <= 1 / 2 implies a7 . b1 = a5 . (2 * b1) ) & ( 1 / 2 <= b1 implies a7 . b1 = a6 . ((2 * b1) - 1) ) );
existence
ex b1 being Path of c2,c4 st
for b2 being Point of I[01] holds
( ( b2 <= 1 / 2 implies b1 . b2 = c5 . (2 * b2) ) & ( 1 / 2 <= b2 implies b1 . b2 = c6 . ((2 * b2) - 1) ) )
proof end;
uniqueness
for b1, b2 being Path of c2,c4 st ( for b3 being Point of I[01] holds
( ( b3 <= 1 / 2 implies b1 . b3 = c5 . (2 * b3) ) & ( 1 / 2 <= b3 implies b1 . b3 = c6 . ((2 * b3) - 1) ) ) ) & ( for b3 being Point of I[01] holds
( ( b3 <= 1 / 2 implies b2 . b3 = c5 . (2 * b3) ) & ( 1 / 2 <= b3 implies b2 . b3 = c6 . ((2 * b3) - 1) ) ) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def5 defines + BORSUK_2:def 5 :
for b1 being non empty TopSpace
for b2, b3, b4 being Point of b1
for b5 being Path of b2,b3
for b6 being Path of b3,b4 st b2,b3 are_connected & b3,b4 are_connected holds
for b7 being Path of b2,b4 holds
( b7 = b5 + b6 iff for b8 being Point of I[01] holds
( ( b8 <= 1 / 2 implies b7 . b8 = b5 . (2 * b8) ) & ( 1 / 2 <= b8 implies b7 . b8 = b6 . ((2 * b8) - 1) ) ) );

registration
let c1 be non empty TopSpace;
let c2 be Point of c1;
cluster constant Path of a2,a2;
existence
ex b1 being Path of c2,c2 st b1 is constant
proof end;
end;

theorem Th6: :: BORSUK_2:6
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being constant Path of b2,b2 holds b3 = I[01] --> b2
proof end;

theorem Th7: :: BORSUK_2:7
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being constant Path of b2,b2 holds b3 + b3 = b3
proof end;

registration
let c1 be non empty TopSpace;
let c2 be Point of c1;
let c3 be constant Path of c2,c2;
cluster a3 + a3 -> constant ;
coherence
c3 + c3 is constant
by Th7;
end;

definition
let c1 be non empty TopSpace;
let c2, c3 be Point of c1;
let c4 be Path of c2,c3;
assume E11: c2,c3 are_connected ;
func - c4 -> Path of a3,a2 means :Def6: :: BORSUK_2:def 6
for b1 being Point of I[01] holds a5 . b1 = a4 . (1 - b1);
existence
ex b1 being Path of c3,c2 st
for b2 being Point of I[01] holds b1 . b2 = c4 . (1 - b2)
proof end;
uniqueness
for b1, b2 being Path of c3,c2 st ( for b3 being Point of I[01] holds b1 . b3 = c4 . (1 - b3) ) & ( for b3 being Point of I[01] holds b2 . b3 = c4 . (1 - b3) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def6 defines - BORSUK_2:def 6 :
for b1 being non empty TopSpace
for b2, b3 being Point of b1
for b4 being Path of b2,b3 st b2,b3 are_connected holds
for b5 being Path of b3,b2 holds
( b5 = - b4 iff for b6 being Point of I[01] holds b5 . b6 = b4 . (1 - b6) );

Lemma12: for b1 being Real st 0 <= b1 & b1 <= 1 holds
( 0 <= 1 - b1 & 1 - b1 <= 1 )
proof end;

Lemma13: for b1 being Real st b1 in the carrier of I[01] holds
1 - b1 in the carrier of I[01]
proof end;

theorem Th8: :: BORSUK_2:8
for b1 being non empty TopSpace
for b2 being Point of b1
for b3 being constant Path of b2,b2 holds - b3 = b3
proof end;

registration
let c1 be non empty TopSpace;
let c2 be Point of c1;
let c3 be constant Path of c2,c2;
cluster - a3 -> constant ;
coherence
- c3 is constant
by Th8;
end;

theorem Th9: :: BORSUK_2:9
for b1, b2 being non empty TopSpace
for b3 being Subset-Family of b2
for b4 being Function of b1,b2 holds b4 " (union b3) = union (b4 " b3)
proof end;

definition
let c1, c2, c3, c4 be non empty TopSpace;
let c5 be Function of c1,c2;
let c6 be Function of c3,c4;
redefine func [: as [:c5,c6:] -> Function of [:a1,a3:],[:a2,a4:];
coherence
[:c5,c6:] is Function of [:c1,c3:],[:c2,c4:]
proof end;
end;

theorem Th10: :: BORSUK_2:10
for b1, b2, b3, b4 being non empty TopSpace
for b5 being continuous Function of b1,b3
for b6 being continuous Function of b2,b4
for b7, b8 being Subset of [:b3,b4:] st b8 in Base-Appr b7 holds
[:b5,b6:] " b8 is open
proof end;

theorem Th11: :: BORSUK_2:11
for b1, b2, b3, b4 being non empty TopSpace
for b5 being continuous Function of b1,b3
for b6 being continuous Function of b2,b4
for b7 being Subset of [:b3,b4:] st b7 is open holds
[:b5,b6:] " b7 is open
proof end;

theorem Th12: :: BORSUK_2:12
for b1, b2, b3, b4 being non empty TopSpace
for b5 being continuous Function of b1,b3
for b6 being continuous Function of b2,b4 holds [:b5,b6:] is continuous
proof end;

registration
cluster empty -> T_0 TopStruct ;
coherence
for b1 being TopStruct st b1 is empty holds
b1 is discerning
by T_0TOPSP:def 7;
end;

registration
let c1, c2 be non empty discerning TopSpace;
cluster [:a1,a2:] -> discerning ;
coherence
[:c1,c2:] is discerning
proof end;
end;

theorem Th13: :: BORSUK_2:13
canceled;

theorem Th14: :: BORSUK_2:14
for b1, b2 being non empty TopSpace st b1 is_T1 & b2 is_T1 holds
[:b1,b2:] is_T1
proof end;

registration
let c1, c2 be non empty being_T1 TopSpace;
cluster [:a1,a2:] -> being_T1 ;
coherence
[:c1,c2:] is being_T1
by Th14;
end;

Lemma20: for b1, b2 being non empty TopSpace st b1 is_T2 & b2 is_T2 holds
[:b1,b2:] is_T2
proof end;

registration
let c1, c2 be non empty being_T2 TopSpace;
cluster [:a1,a2:] -> discerning being_T2 ;
coherence
[:c1,c2:] is being_T2
by Lemma20;
end;

registration
cluster I[01] -> compact being_T2 ;
coherence
( I[01] is compact & I[01] is being_T2 )
proof end;
end;

definition
let c1 be non empty TopStruct ;
let c2, c3 be Point of c1;
let c4, c5 be Path of c2,c3;
pred c4,c5 are_homotopic means :: BORSUK_2:def 7
ex b1 being Function of [:I[01] ,I[01] :],a1 st
( b1 is continuous & ( for b2 being Point of I[01] holds
( b1 . b2,0 = a4 . b2 & b1 . b2,1 = a5 . b2 & ( for b3 being Point of I[01] holds
( b1 . 0,b3 = a2 & b1 . 1,b3 = a3 ) ) ) ) );
symmetry
for b1, b2 being Path of c2,c3 st ex b3 being Function of [:I[01] ,I[01] :],c1 st
( b3 is continuous & ( for b4 being Point of I[01] holds
( b3 . b4,0 = b1 . b4 & b3 . b4,1 = b2 . b4 & ( for b5 being Point of I[01] holds
( b3 . 0,b5 = c2 & b3 . 1,b5 = c3 ) ) ) ) ) holds
ex b3 being Function of [:I[01] ,I[01] :],c1 st
( b3 is continuous & ( for b4 being Point of I[01] holds
( b3 . b4,0 = b2 . b4 & b3 . b4,1 = b1 . b4 & ( for b5 being Point of I[01] holds
( b3 . 0,b5 = c2 & b3 . 1,b5 = c3 ) ) ) ) )
proof end;
end;

:: deftheorem Def7 defines are_homotopic BORSUK_2:def 7 :
for b1 being non empty TopStruct
for b2, b3 being Point of b1
for b4, b5 being Path of b2,b3 holds
( b4,b5 are_homotopic iff ex b6 being Function of [:I[01] ,I[01] :],b1 st
( b6 is continuous & ( for b7 being Point of I[01] holds
( b6 . b7,0 = b4 . b7 & b6 . b7,1 = b5 . b7 & ( for b8 being Point of I[01] holds
( b6 . 0,b8 = b2 & b6 . 1,b8 = b3 ) ) ) ) ) );

theorem Th15: :: BORSUK_2:15
for b1 being non empty TopSpace
for b2, b3 being Point of b1
for b4 being Path of b2,b3 st b2,b3 are_connected holds
b4,b4 are_homotopic
proof end;

definition
let c1 be non empty arcwise_connected TopSpace;
let c2, c3 be Point of c1;
let c4, c5 be Path of c2,c3;
redefine pred are_homotopic as c4,c5 are_homotopic ;
reflexivity
for b1 being Path of c2,c3 holds b1,b1 are_homotopic
proof end;
end;