(99steps total)
PrintForm
Definitions
Lemmas
graph
1
2
Sections
Graphs
Doc
At:
Ramsey-recursion
1
1
1
1
1
1.
r:
2.
k:
3.
L:
List
4.
R:
List
5.
2
k
6.
||R|| = ||L||
7.
i:
||L||. 0 < L[i]
R[i]- > L[i--]^k
8.
r- > R^k-1
9.
n:
10.
r+1
n
11.
G:
{s:(
n List)| ||s|| = k
& (
x,y:
||s||. x < y
s[x] < s[y]) }
||L||
12.
s:
(n-1) List
13.
||s|| = k-1
14.
x,y:
||s||. x < y
s[x] < s[y]
15.
x:
(||s||+1)
16.
y:
(||s||+1)
17.
x < y
18.
y = ||s||
(s @ [(n-1)])[x] < (s @ [(n-1)])[y]
By:
RW (AddrC [2] (LemmaC
Thm*
as,bs:T List, i:{||as||..(||as||+||bs||)
}. (as @ bs)[i] = bs[(i-||as||)])) 0
THEN
RWO
Thm*
as,bs:T List, i:
||as||. (as @ bs)[i] = as[i] 0
Generated subgoal:
1
s[x] < [(n-1)][(y-||s||)]
1
step
About:
(99steps total)
PrintForm
Definitions
Lemmas
graph
1
2
Sections
Graphs
Doc