:: BORSUK_5 semantic presentation
theorem Th1: :: BORSUK_5:1
canceled;
theorem Th2: :: BORSUK_5:2
for b
1, b
2, b
3 being
set holds
not ( b
1 c= b
2 & b
2 c= b
1 \/ {b3} & not b
1 \/ {b3} = b
2 & not b
1 = b
2 )
theorem Th3: :: BORSUK_5:3
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
{b1,b2,b3,b4,b5,b6} = {b1,b3,b6} \/ {b2,b4,b5}
definition
let c
1, c
2, c
3, c
4, c
5, c
6 be
set ;
pred c
1,c
2,c
3,c
4,c
5,c
6 are_mutually_different means :
Def1:
:: BORSUK_5:def 1
( a
1 <> a
2 & a
1 <> a
3 & a
1 <> a
4 & a
1 <> a
5 & a
1 <> a
6 & a
2 <> a
3 & a
2 <> a
4 & a
2 <> a
5 & a
2 <> a
6 & a
3 <> a
4 & a
3 <> a
5 & a
3 <> a
6 & a
4 <> a
5 & a
4 <> a
6 & a
5 <> a
6 );
end;
:: deftheorem Def1 defines are_mutually_different BORSUK_5:def 1 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6 are_mutually_different iff ( b
1 <> b
2 & b
1 <> b
3 & b
1 <> b
4 & b
1 <> b
5 & b
1 <> b
6 & b
2 <> b
3 & b
2 <> b
4 & b
2 <> b
5 & b
2 <> b
6 & b
3 <> b
4 & b
3 <> b
5 & b
3 <> b
6 & b
4 <> b
5 & b
4 <> b
6 & b
5 <> b
6 ) );
definition
let c
1, c
2, c
3, c
4, c
5, c
6, c
7 be
set ;
pred c
1,c
2,c
3,c
4,c
5,c
6,c
7 are_mutually_different means :
Def2:
:: BORSUK_5:def 2
( a
1 <> a
2 & a
1 <> a
3 & a
1 <> a
4 & a
1 <> a
5 & a
1 <> a
6 & a
1 <> a
7 & a
2 <> a
3 & a
2 <> a
4 & a
2 <> a
5 & a
2 <> a
6 & a
2 <> a
7 & a
3 <> a
4 & a
3 <> a
5 & a
3 <> a
6 & a
3 <> a
7 & a
4 <> a
5 & a
4 <> a
6 & a
4 <> a
7 & a
5 <> a
6 & a
5 <> a
7 & a
6 <> a
7 );
end;
:: deftheorem Def2 defines are_mutually_different BORSUK_5:def 2 :
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6,b
7 are_mutually_different iff ( b
1 <> b
2 & b
1 <> b
3 & b
1 <> b
4 & b
1 <> b
5 & b
1 <> b
6 & b
1 <> b
7 & b
2 <> b
3 & b
2 <> b
4 & b
2 <> b
5 & b
2 <> b
6 & b
2 <> b
7 & b
3 <> b
4 & b
3 <> b
5 & b
3 <> b
6 & b
3 <> b
7 & b
4 <> b
5 & b
4 <> b
6 & b
4 <> b
7 & b
5 <> b
6 & b
5 <> b
7 & b
6 <> b
7 ) );
theorem Th4: :: BORSUK_5:4
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6 are_mutually_different implies
card {b1,b2,b3,b4,b5,b6} = 6 )
theorem Th5: :: BORSUK_5:5
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6,b
7 are_mutually_different implies
card {b1,b2,b3,b4,b5,b6,b7} = 7 )
theorem Th6: :: BORSUK_5:6
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
(
{b1,b2,b3} misses {b4,b5,b6} implies ( b
1 <> b
4 & b
1 <> b
5 & b
1 <> b
6 & b
2 <> b
4 & b
2 <> b
5 & b
2 <> b
6 & b
3 <> b
4 & b
3 <> b
5 & b
3 <> b
6 ) )
theorem Th7: :: BORSUK_5:7
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1,b
2,b
3 are_mutually_different & b
4,b
5,b
6 are_mutually_different &
{b1,b2,b3} misses {b4,b5,b6} implies b
1,b
2,b
3,b
4,b
5,b
6 are_mutually_different )
theorem Th8: :: BORSUK_5:8
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6 are_mutually_different &
{b1,b2,b3,b4,b5,b6} misses {b7} implies b
1,b
2,b
3,b
4,b
5,b
6,b
7 are_mutually_different )
theorem Th9: :: BORSUK_5:9
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6,b
7 are_mutually_different implies b
7,b
1,b
2,b
3,b
4,b
5,b
6 are_mutually_different )
theorem Th10: :: BORSUK_5:10
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
( b
1,b
2,b
3,b
4,b
5,b
6,b
7 are_mutually_different implies b
1,b
2,b
5,b
3,b
6,b
7,b
4 are_mutually_different )
theorem Th11: :: BORSUK_5:11
Lemma7:
R^1 is arcwise_connected
theorem Th12: :: BORSUK_5:12
canceled;
theorem Th13: :: BORSUK_5:13
theorem Th14: :: BORSUK_5:14
theorem Th15: :: BORSUK_5:15
theorem Th16: :: BORSUK_5:16
theorem Th17: :: BORSUK_5:17
theorem Th18: :: BORSUK_5:18
theorem Th19: :: BORSUK_5:19
theorem Th20: :: BORSUK_5:20
theorem Th21: :: BORSUK_5:21
Lemma16:
for b1 being real number holds REAL \ ].-infty,b1.[ = [.b1,+infty.[
by LIMFUNC1:24;
Lemma17:
for b1 being real number holds REAL \ ].-infty,b1.] = ].b1,+infty.[
by LIMFUNC1:24;
Lemma18:
for b1 being real number holds REAL \ [.b1,+infty.[ = ].-infty,b1.[
by LIMFUNC1:24;
theorem Th22: :: BORSUK_5:22
canceled;
theorem Th23: :: BORSUK_5:23
canceled;
theorem Th24: :: BORSUK_5:24
canceled;
theorem Th25: :: BORSUK_5:25
canceled;
theorem Th26: :: BORSUK_5:26
theorem Th27: :: BORSUK_5:27
theorem Th28: :: BORSUK_5:28
theorem Th29: :: BORSUK_5:29
theorem Th30: :: BORSUK_5:30
canceled;
theorem Th31: :: BORSUK_5:31
canceled;
theorem Th32: :: BORSUK_5:32
canceled;
theorem Th33: :: BORSUK_5:33
theorem Th34: :: BORSUK_5:34
theorem Th35: :: BORSUK_5:35
theorem Th36: :: BORSUK_5:36
:: deftheorem Def3 defines IRRAT BORSUK_5:def 3 :
:: deftheorem Def4 defines RAT BORSUK_5:def 4 :
:: deftheorem Def5 defines IRRAT BORSUK_5:def 5 :
theorem Th37: :: BORSUK_5:37
theorem Th38: :: BORSUK_5:38
theorem Th39: :: BORSUK_5:39
theorem Th40: :: BORSUK_5:40
theorem Th41: :: BORSUK_5:41
theorem Th42: :: BORSUK_5:42
theorem Th43: :: BORSUK_5:43
theorem Th44: :: BORSUK_5:44
theorem Th45: :: BORSUK_5:45
theorem Th46: :: BORSUK_5:46
canceled;
theorem Th47: :: BORSUK_5:47
Lemma36:
for b1, b2, b3, b4 being real number holds
not ( b1 <= b2 & b1 < b3 & 0 < b4 & b4 < 1 & not b1 < ((1 - b4) * b2) + (b4 * b3) )
by XREAL_1:179;
Lemma37:
for b1, b2, b3, b4 being real number holds
not ( b2 < b1 & b3 <= b1 & 0 < b4 & b4 < 1 & not ((1 - b4) * b2) + (b4 * b3) < b1 )
by XREAL_1:180;
theorem Th48: :: BORSUK_5:48
canceled;
theorem Th49: :: BORSUK_5:49
canceled;
theorem Th50: :: BORSUK_5:50
theorem Th51: :: BORSUK_5:51
Lemma40:
for b1 being Subset of R^1
for b2, b3 being real number holds
( b2 < b3 & b1 = RAT b2,b3 implies ( b2 in Cl b1 & b3 in Cl b1 ) )
Lemma41:
for b1 being Subset of R^1
for b2, b3 being real number holds
( b2 < b3 & b1 = IRRAT b2,b3 implies ( b2 in Cl b1 & b3 in Cl b1 ) )
theorem Th52: :: BORSUK_5:52
theorem Th53: :: BORSUK_5:53
theorem Th54: :: BORSUK_5:54
theorem Th55: :: BORSUK_5:55
theorem Th56: :: BORSUK_5:56
theorem Th57: :: BORSUK_5:57
theorem Th58: :: BORSUK_5:58
theorem Th59: :: BORSUK_5:59
theorem Th60: :: BORSUK_5:60
theorem Th61: :: BORSUK_5:61
theorem Th62: :: BORSUK_5:62
Lemma52:
for b1 being real number holds ].b1,+infty.[ is open
by FCONT_3:7;
Lemma53:
for b1 being real number holds ].-infty,b1.] is closed
by FCONT_3:6;
Lemma54:
for b1 being real number holds ].-infty,b1.[ is open
by FCONT_3:8;
Lemma55:
for b1 being real number holds [.b1,+infty.[ is closed
by FCONT_3:5;
theorem Th63: :: BORSUK_5:63
theorem Th64: :: BORSUK_5:64
theorem Th65: :: BORSUK_5:65
theorem Th66: :: BORSUK_5:66
theorem Th67: :: BORSUK_5:67
theorem Th68: :: BORSUK_5:68
Lemma62:
for b1 being real number holds ].b1,+infty.[ c= [.b1,+infty.[
by LIMFUNC1:10;
Lemma63:
for b1 being real number holds ].-infty,b1.[ c= ].-infty,b1.]
by LIMFUNC1:15;
theorem Th69: :: BORSUK_5:69
canceled;
theorem Th70: :: BORSUK_5:70
canceled;
theorem Th71: :: BORSUK_5:71
theorem Th72: :: BORSUK_5:72
theorem Th73: :: BORSUK_5:73
theorem Th74: :: BORSUK_5:74
theorem Th75: :: BORSUK_5:75
theorem Th76: :: BORSUK_5:76
theorem Th77: :: BORSUK_5:77
theorem Th78: :: BORSUK_5:78
theorem Th79: :: BORSUK_5:79
theorem Th80: :: BORSUK_5:80
theorem Th81: :: BORSUK_5:81
theorem Th82: :: BORSUK_5:82
theorem Th83: :: BORSUK_5:83
theorem Th84: :: BORSUK_5:84
Lemma71:
for b1, b2 being real number holds
( b2 <= b1 implies RAT b1,b2 = {} )
Lemma72:
for b1, b2 being real number holds
( b2 <= b1 implies REAL = ].-infty,b1.] \/ [.b2,+infty.[ )
theorem Th85: :: BORSUK_5:85
theorem Th86: :: BORSUK_5:86
theorem Th87: :: BORSUK_5:87
theorem Th88: :: BORSUK_5:88
theorem Th89: :: BORSUK_5:89
theorem Th90: :: BORSUK_5:90
Lemma77:
((IRRAT 2,4) \/ {4}) \/ {5} c= ].1,+infty.[
].1,+infty.[ c= [.1,+infty.[
by Lemma62;
then Lemma78:
((IRRAT 2,4) \/ {4}) \/ {5} c= [.1,+infty.[
by Lemma77, XBOOLE_1:1;
Lemma79:
].-infty,1.[ /\ (((].-infty,2.] \/ (IRRAT 2,4)) \/ {4}) \/ {5}) = ].-infty,1.[
theorem Th91: :: BORSUK_5:91
Lemma81:
].1,+infty.[ /\ (((].-infty,2.] \/ (IRRAT 2,4)) \/ {4}) \/ {5}) = ((].1,2.] \/ (IRRAT 2,4)) \/ {4}) \/ {5}
theorem Th92: :: BORSUK_5:92
theorem Th93: :: BORSUK_5:93
theorem Th94: :: BORSUK_5:94
theorem Th95: :: BORSUK_5:95
theorem Th96: :: BORSUK_5:96
theorem Th97: :: BORSUK_5:97
theorem Th98: :: BORSUK_5:98
theorem Th99: :: BORSUK_5:99
theorem Th100: :: BORSUK_5:100
theorem Th101: :: BORSUK_5:101
theorem Th102: :: BORSUK_5:102
theorem Th103: :: BORSUK_5:103
theorem Th104: :: BORSUK_5:104
theorem Th105: :: BORSUK_5:105
theorem Th106: :: BORSUK_5:106
theorem Th107: :: BORSUK_5:107
theorem Th108: :: BORSUK_5:108
theorem Th109: :: BORSUK_5:109
theorem Th110: :: BORSUK_5:110
theorem Th111: :: BORSUK_5:111
theorem Th112: :: BORSUK_5:112
theorem Th113: :: BORSUK_5:113
:: deftheorem Def6 defines with_proper_subsets BORSUK_5:def 6 :
theorem Th114: :: BORSUK_5:114
theorem Th115: :: BORSUK_5:115