(30steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: Ramsey-base-case 1 1 1 1 1 1 1 2 1
1. L: List
2. n:
3. G: {s:(n List)| ||s|| = 1 & (x,y:||s||. x < y s[x] < s[y]) }||L||
4. c: ||L||
5. A: List
6. m:
7. m||A||
8. x:||A||. A[x] < n & G([A[x]]) = c
9. x,y:||A||. x < y A[x] > A[y]
increasing(x.A[(||A||-(x+1))];m)
By:
Analyze 0
THEN
Reduce 0
THEN
InstHyp [||A||-(i+1+1);||A||-(i+1)] -2
Generated subgoals:

None

About:
listconsnilintnatural_numberaddsubtractless_thanset
lambdaapplyfunctionequalimpliesandall

(30steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc