:: BORSUK_6 semantic presentation
scheme :: BORSUK_6:sch 1
s1{ F
1()
-> non
empty set , P
1[
set ], P
2[
set ], P
3[
set ], F
2(
set )
-> set , F
3(
set )
-> set , F
4(
set )
-> set } :
ex b
1 being
Function st
(
dom b
1 = F
1() & ( for b
2 being
Element of F
1() holds
( ( P
1[b
2] implies b
1 . b
2 = F
2(b
2) ) & ( P
2[b
2] implies b
1 . b
2 = F
3(b
2) ) & ( P
3[b
2] implies b
1 . b
2 = F
4(b
2) ) ) ) )
provided
E1:
for b
1 being
Element of F
1() holds
( not ( P
1[b
1] & P
2[b
1] ) & not ( P
1[b
1] & P
3[b
1] ) & not ( P
2[b
1] & P
3[b
1] ) )
and
E2:
for b
1 being
Element of F
1() holds
not ( not P
1[b
1] & not P
2[b
1] & not P
3[b
1] )
proof
E3:
for b
1 being
set holds
( b
1 in F
1() implies ( not ( P
1[b
1] & P
2[b
1] ) & not ( P
1[b
1] & P
3[b
1] ) & not ( P
2[b
1] & P
3[b
1] ) ) )
by E1;
E4:
for b
1 being
set holds
not ( b
1 in F
1() & not P
1[b
1] & not P
2[b
1] & not P
3[b
1] )
by E2;
ex b
1 being
Function st
(
dom b
1 = F
1() & ( for b
2 being
set holds
( b
2 in F
1() implies ( ( P
1[b
2] implies b
1 . b
2 = F
2(b
2) ) & ( P
2[b
2] implies b
1 . b
2 = F
3(b
2) ) & ( P
3[b
2] implies b
1 . b
2 = F
4(b
2) ) ) ) ) )
from RECDEF_2:sch 1(E3, E4);
then consider c
1 being
Function such that E5:
dom c
1 = F
1()
and E6:
for b
1 being
set holds
( b
1 in F
1() implies ( ( P
1[b
1] implies c
1 . b
1 = F
2(b
1) ) & ( P
2[b
1] implies c
1 . b
1 = F
3(b
1) ) & ( P
3[b
1] implies c
1 . b
1 = F
4(b
1) ) ) )
;
take
c
1
;
thus
dom c
1 = F
1()
by E5;
let c
2 be
Element of F
1();
thus
( ( P
1[c
2] implies c
1 . c
2 = F
2(c
2) ) & ( P
2[c
2] implies c
1 . c
2 = F
3(c
2) ) & ( P
3[c
2] implies c
1 . c
2 = F
4(c
2) ) )
by E6;
end;
theorem E1: :: BORSUK_6:1
E2:
for b1, b2, b3, b4 being complex number holds (((b4 - b3) / b2) * b1) + b3 = ((1 - (b1 / b2)) * b3) + ((b1 / b2) * b4)
by XCMPLX_1:236;
theorem :: BORSUK_6:2
canceled;
theorem :: BORSUK_6:3
canceled;
theorem :: BORSUK_6:4
canceled;
theorem E3: :: BORSUK_6:5
proof
let c
1, c
2, c
3 be
real number ;
assume E4:
( c
1 <= c
3 & c
3 <= c
2 )
;
then E5:
c
3 - c
1 <= c
2 - c
1
by XREAL_1:11;
E6:
c
1 <= c
2
by E4, XXREAL_0:2;
then E7:
c
2 - c
1 >= 0
by XREAL_1:50;
E8:
(c3 - c1) / (c2 - c1) <= 1
proof
per cases
not ( not c
2 - c
1 = 0 & not c
2 - c
1 > 0 )
by E6, XREAL_1:50;
suppose
c
2 - c
1 = 0
;
end;
suppose
c
2 - c
1 > 0
;
end;
end;
end;
E9:
c
3 - c
1 >= 0
by E4, XREAL_1:50;
(c3 - c1) / (c2 - c1) >= 0
by E7, E9, REAL_2:125;
then
(c3 - c1) / (c2 - c1) in [.0,1.]
by E8, RCOMP_1:48;
hence
(c3 - c1) / (c2 - c1) in the
carrier of
(Closed-Interval-TSpace 0,1)
by TOPMETR:25;
end;
theorem E4: :: BORSUK_6:6
theorem E5: :: BORSUK_6:7
theorem E6: :: BORSUK_6:8
theorem E7: :: BORSUK_6:9
theorem E8: :: BORSUK_6:10
theorem :: BORSUK_6:11
canceled;
theorem E9: :: BORSUK_6:12
theorem E10: :: BORSUK_6:13
proof
let c
1, c
2, c
3, c
4 be
Point of
I[01] ;
assume that E11:
c
1 <= c
2
and E12:
c
3 <= c
4
;
E13:
[.c1,c2.] is
Subset of
I[01]
by BORSUK_4:43;
[.c3,c4.] is
Subset of
I[01]
by BORSUK_4:43;
then E14:
[:[.c1,c2.],[.c3,c4.]:] c= [:the carrier of I[01] ,the carrier of I[01] :]
by E13, ZFMISC_1:119;
E15:
c
1 in [.c1,c2.]
by E11, RCOMP_1:48;
c
3 in [.c3,c4.]
by E12, RCOMP_1:48;
then reconsider c
5 =
[:[.c1,c2.],[.c3,c4.]:] as non
empty Subset of
[:I[01] ,I[01] :] by E14, E15, BORSUK_1:def 5, ZFMISC_1:106;
(
[.c1,c2.] is
compact Subset of
I[01] &
[.c3,c4.] is
compact Subset of
I[01] )
by E11, E12, BORSUK_4:49;
then
c
5 is
compact Subset of
[:I[01] ,I[01] :]
by BORSUK_3:27;
hence
[:[.c1,c2.],[.c3,c4.]:] is non
empty compact Subset of
[:I[01] ,I[01] :]
;
end;
theorem E11: :: BORSUK_6:14
proof
let c
1, c
2 be
Subset of
(TOP-REAL 2);
assume E12:
( c
1 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 <= (2 * (b1 `1 )) - 1 } & c
2 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 <= b1 `1 } )
;
set c
3 = 1;
set c
4 = 0;
set c
5 = 1
/ 2;
set c
6 = 1
/ 2;
set c
7 =
AffineMap 1,0,
(1 / 2),
(1 / 2);
(AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1 = c
2
proof
thus
(AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1 c= c
2
:: according to XBOOLE_0:def 10
proof
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in (AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1
;
then consider c
9 being
set such that E13:
( c
9 in dom (AffineMap 1,0,(1 / 2),(1 / 2)) & c
9 in c
1 & c
8 = (AffineMap 1,0,(1 / 2),(1 / 2)) . c
9 )
by FUNCT_1:def 12;
consider c
10 being
Point of
(TOP-REAL 2) such that E14:
( c
9 = c
10 & c
10 `2 <= (2 * (c10 `1 )) - 1 )
by E12, E13;
set c
11 =
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
10;
E15:
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
10 = |[((1 * (c10 `1 )) + 0),(((1 / 2) * (c10 `2 )) + (1 / 2))]|
by JGRAPH_2:def 2;
then E16:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c10) `1 = (1 * (c10 `1 )) + 0
by EUCLID:56;
E17:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c10) `2 = ((1 / 2) * (c10 `2 )) + (1 / 2)
by E15, EUCLID:56;
(1 / 2) * (c10 `2 ) <= (1 / 2) * ((2 * (c10 `1 )) - 1)
by E14, XREAL_1:66;
then
((1 / 2) * (c10 `2 )) + (1 / 2) <= ((c10 `1 ) - (1 / 2)) + (1 / 2)
by XREAL_1:8;
hence
c
8 in c
2
by E12, E13, E14, E16, E17;
end;
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in c
2
;
then consider c
9 being
Point of
(TOP-REAL 2) such that E13:
( c
8 = c
9 & c
9 `2 <= c
9 `1 )
by E12;
AffineMap 1,0,
(1 / 2),
(1 / 2) is
onto
by JORDAN1K:36;
then
rng (AffineMap 1,0,(1 / 2),(1 / 2)) = the
carrier of
(TOP-REAL 2)
by FUNCT_2:def 3;
then consider c
10 being
set such that E14:
( c
10 in dom (AffineMap 1,0,(1 / 2),(1 / 2)) & c
8 = (AffineMap 1,0,(1 / 2),(1 / 2)) . c
10 )
by E13, FUNCT_1:def 5;
reconsider c
11 = c
10 as
Point of
(TOP-REAL 2) by E14;
set c
12 =
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
11;
E15:
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
11 = |[((1 * (c11 `1 )) + 0),(((1 / 2) * (c11 `2 )) + (1 / 2))]|
by JGRAPH_2:def 2;
then E16:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `1 = c
11 `1
by EUCLID:56;
E17:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `2 = ((1 / 2) * (c11 `2 )) + (1 / 2)
by E15, EUCLID:56;
2
* (((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `2 ) <= 2
* (c11 `1 )
by E13, E14, E16, XREAL_1:66;
then
(2 * (((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `2 )) - 1
<= (2 * (c11 `1 )) - 1
by XREAL_1:11;
then
c
11 in c
1
by E12, E17;
hence
c
8 in (AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1
by E14, FUNCT_1:def 12;
end;
hence
(AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1 = c
2
;
end;
theorem E12: :: BORSUK_6:15
proof
let c
1, c
2 be
Subset of
(TOP-REAL 2);
assume E13:
( c
1 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 >= (2 * (b1 `1 )) - 1 } & c
2 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 >= b1 `1 } )
;
set c
3 = 1;
set c
4 = 0;
set c
5 = 1
/ 2;
set c
6 = 1
/ 2;
set c
7 =
AffineMap 1,0,
(1 / 2),
(1 / 2);
(AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1 = c
2
proof
thus
(AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1 c= c
2
:: according to XBOOLE_0:def 10
proof
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in (AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1
;
then consider c
9 being
set such that E14:
( c
9 in dom (AffineMap 1,0,(1 / 2),(1 / 2)) & c
9 in c
1 & c
8 = (AffineMap 1,0,(1 / 2),(1 / 2)) . c
9 )
by FUNCT_1:def 12;
consider c
10 being
Point of
(TOP-REAL 2) such that E15:
( c
9 = c
10 & c
10 `2 >= (2 * (c10 `1 )) - 1 )
by E13, E14;
set c
11 =
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
10;
E16:
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
10 = |[((1 * (c10 `1 )) + 0),(((1 / 2) * (c10 `2 )) + (1 / 2))]|
by JGRAPH_2:def 2;
then E17:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c10) `1 = (1 * (c10 `1 )) + 0
by EUCLID:56;
E18:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c10) `2 = ((1 / 2) * (c10 `2 )) + (1 / 2)
by E16, EUCLID:56;
(1 / 2) * (c10 `2 ) >= (1 / 2) * ((2 * (c10 `1 )) - 1)
by E15, XREAL_1:66;
then
((AffineMap 1,0,(1 / 2),(1 / 2)) . c10) `2 >= ((c10 `1 ) - (1 / 2)) + (1 / 2)
by E18, XREAL_1:8;
hence
c
8 in c
2
by E13, E14, E15, E17;
end;
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in c
2
;
then consider c
9 being
Point of
(TOP-REAL 2) such that E14:
( c
8 = c
9 & c
9 `2 >= c
9 `1 )
by E13;
AffineMap 1,0,
(1 / 2),
(1 / 2) is
onto
by JORDAN1K:36;
then
rng (AffineMap 1,0,(1 / 2),(1 / 2)) = the
carrier of
(TOP-REAL 2)
by FUNCT_2:def 3;
then consider c
10 being
set such that E15:
( c
10 in dom (AffineMap 1,0,(1 / 2),(1 / 2)) & c
8 = (AffineMap 1,0,(1 / 2),(1 / 2)) . c
10 )
by E14, FUNCT_1:def 5;
reconsider c
11 = c
10 as
Point of
(TOP-REAL 2) by E15;
set c
12 =
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
11;
E16:
(AffineMap 1,0,(1 / 2),(1 / 2)) . c
11 = |[((1 * (c11 `1 )) + 0),(((1 / 2) * (c11 `2 )) + (1 / 2))]|
by JGRAPH_2:def 2;
then E17:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `1 = c
11 `1
by EUCLID:56;
E18:
((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `2 = ((1 / 2) * (c11 `2 )) + (1 / 2)
by E16, EUCLID:56;
2
* (((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `2 ) >= 2
* (c11 `1 )
by E14, E15, E17, XREAL_1:66;
then
(2 * (((AffineMap 1,0,(1 / 2),(1 / 2)) . c11) `2 )) - 1
>= (2 * (c11 `1 )) - 1
by XREAL_1:11;
then
c
11 in c
1
by E13, E18;
hence
c
8 in (AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1
by E15, FUNCT_1:def 12;
end;
hence
(AffineMap 1,0,(1 / 2),(1 / 2)) .: c
1 = c
2
;
end;
theorem E13: :: BORSUK_6:16
proof
let c
1, c
2 be
Subset of
(TOP-REAL 2);
assume E14:
( c
1 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 >= 1 - (2 * (b1 `1 )) } & c
2 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 >= - (b1 `1 ) } )
;
set c
3 = 1;
set c
4 = 0;
set c
5 = 1
/ 2;
set c
6 =
- (1 / 2);
set c
7 =
AffineMap 1,0,
(1 / 2),
(- (1 / 2));
(AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1 = c
2
proof
thus
(AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1 c= c
2
:: according to XBOOLE_0:def 10
proof
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in (AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1
;
then consider c
9 being
set such that E15:
( c
9 in dom (AffineMap 1,0,(1 / 2),(- (1 / 2))) & c
9 in c
1 & c
8 = (AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
9 )
by FUNCT_1:def 12;
consider c
10 being
Point of
(TOP-REAL 2) such that E16:
( c
9 = c
10 & c
10 `2 >= 1
- (2 * (c10 `1 )) )
by E14, E15;
set c
11 =
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
10;
E17:
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
10 = |[((1 * (c10 `1 )) + 0),(((1 / 2) * (c10 `2 )) + (- (1 / 2)))]|
by JGRAPH_2:def 2;
then E18:
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c10) `1 = (1 * (c10 `1 )) + 0
by EUCLID:56;
(1 / 2) * (c10 `2 ) >= (1 / 2) * (1 - (2 * (c10 `1 )))
by E16, XREAL_1:66;
then
((1 / 2) * (c10 `2 )) + (- (1 / 2)) >= ((1 / 2) - (c10 `1 )) + (- (1 / 2))
by XREAL_1:8;
then
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c10) `2 >= - (((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c10) `1 )
by E17, E18, EUCLID:56;
hence
c
8 in c
2
by E14, E15, E16;
end;
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in c
2
;
then consider c
9 being
Point of
(TOP-REAL 2) such that E15:
( c
8 = c
9 & c
9 `2 >= - (c9 `1 ) )
by E14;
AffineMap 1,0,
(1 / 2),
(- (1 / 2)) is
onto
by JORDAN1K:36;
then
rng (AffineMap 1,0,(1 / 2),(- (1 / 2))) = the
carrier of
(TOP-REAL 2)
by FUNCT_2:def 3;
then consider c
10 being
set such that E16:
( c
10 in dom (AffineMap 1,0,(1 / 2),(- (1 / 2))) & c
8 = (AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
10 )
by E15, FUNCT_1:def 5;
reconsider c
11 = c
10 as
Point of
(TOP-REAL 2) by E16;
set c
12 =
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
11;
E17:
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
11 = |[((1 * (c11 `1 )) + 0),(((1 / 2) * (c11 `2 )) + (- (1 / 2)))]|
by JGRAPH_2:def 2;
then E18:
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `1 = c
11 `1
by EUCLID:56;
E19:
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `2 = ((1 / 2) * (c11 `2 )) + (- (1 / 2))
by E17, EUCLID:56;
2
* (((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `2 ) >= 2
* (- (c11 `1 ))
by E15, E16, E18, XREAL_1:66;
then
(2 * (((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `2 )) + 1
>= (2 * (- (c11 `1 ))) + 1
by XREAL_1:8;
then
c
11 `2 >= 1
- (2 * (c11 `1 ))
by E19;
then
c
11 in c
1
by E14;
hence
c
8 in (AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1
by E16, FUNCT_1:def 12;
end;
hence
(AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1 = c
2
;
end;
theorem E14: :: BORSUK_6:17
proof
let c
1, c
2 be
Subset of
(TOP-REAL 2);
assume E15:
( c
1 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 <= 1 - (2 * (b1 `1 )) } & c
2 = { b1 where B is Point of (TOP-REAL 2) : b1 `2 <= - (b1 `1 ) } )
;
set c
3 = 1;
set c
4 = 0;
set c
5 = 1
/ 2;
set c
6 =
- (1 / 2);
set c
7 =
AffineMap 1,0,
(1 / 2),
(- (1 / 2));
(AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1 = c
2
proof
thus
(AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1 c= c
2
:: according to XBOOLE_0:def 10
proof
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in (AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1
;
then consider c
9 being
set such that E16:
( c
9 in dom (AffineMap 1,0,(1 / 2),(- (1 / 2))) & c
9 in c
1 & c
8 = (AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
9 )
by FUNCT_1:def 12;
consider c
10 being
Point of
(TOP-REAL 2) such that E17:
( c
9 = c
10 & c
10 `2 <= 1
- (2 * (c10 `1 )) )
by E15, E16;
set c
11 =
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
10;
E18:
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
10 = |[((1 * (c10 `1 )) + 0),(((1 / 2) * (c10 `2 )) + (- (1 / 2)))]|
by JGRAPH_2:def 2;
then E19:
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c10) `1 = (1 * (c10 `1 )) + 0
by EUCLID:56;
(1 / 2) * (c10 `2 ) <= (1 / 2) * (1 - (2 * (c10 `1 )))
by E17, XREAL_1:66;
then
((1 / 2) * (c10 `2 )) + (- (1 / 2)) <= ((1 / 2) - (c10 `1 )) + (- (1 / 2))
by XREAL_1:8;
then
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c10) `2 <= - (((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c10) `1 )
by E18, E19, EUCLID:56;
hence
c
8 in c
2
by E15, E16, E17;
end;
let c
8 be
set ;
:: according to TARSKI:def 3
assume
c
8 in c
2
;
then consider c
9 being
Point of
(TOP-REAL 2) such that E16:
( c
8 = c
9 & c
9 `2 <= - (c9 `1 ) )
by E15;
AffineMap 1,0,
(1 / 2),
(- (1 / 2)) is
onto
by JORDAN1K:36;
then
rng (AffineMap 1,0,(1 / 2),(- (1 / 2))) = the
carrier of
(TOP-REAL 2)
by FUNCT_2:def 3;
then consider c
10 being
set such that E17:
( c
10 in dom (AffineMap 1,0,(1 / 2),(- (1 / 2))) & c
8 = (AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
10 )
by E16, FUNCT_1:def 5;
reconsider c
11 = c
10 as
Point of
(TOP-REAL 2) by E17;
set c
12 =
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
11;
E18:
(AffineMap 1,0,(1 / 2),(- (1 / 2))) . c
11 = |[((1 * (c11 `1 )) + 0),(((1 / 2) * (c11 `2 )) + (- (1 / 2)))]|
by JGRAPH_2:def 2;
then E19:
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `1 = c
11 `1
by EUCLID:56;
E20:
((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `2 = ((1 / 2) * (c11 `2 )) + (- (1 / 2))
by E18, EUCLID:56;
2
* (((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `2 ) <= 2
* (- (c11 `1 ))
by E16, E17, E19, XREAL_1:66;
then
(2 * (((AffineMap 1,0,(1 / 2),(- (1 / 2))) . c11) `2 )) + 1
<= (2 * (- (c11 `1 ))) + 1
by XREAL_1:8;
then
c
11 `2 <= 1
- (2 * (c11 `1 ))
by E20;
then
c
11 in c
1
by E15;
hence
c
8 in (AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1
by E17, FUNCT_1:def 12;
end;
hence
(AffineMap 1,0,(1 / 2),(- (1 / 2))) .: c
1 = c
2
;
end;
:: deftheorem E15 defines real-membered BORSUK_6:def 1 :
theorem E16: :: BORSUK_6:18