Nuprl - Proof: Ramsey-base-case 1 1 1 1 1 1 1 3

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

At: Ramsey-base-case 1 1 1 1 1 1 1 3

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]
10. f: mn

(increasing(f;m) & (s:m. G([(f(s))]) = c)) Prop

By: Auto THEN Analyze THEN Reduce 0

Generated subgoals:

None

About:

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