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

At: Ramsey-base-case

L: List. sum(L[i]-1 | i < ||L||)+1- > L^1

By:
Auto
THEN
Analyze 0


Generated subgoal:

11. L: List
2. n:
3. sum(L[i]-1 | i < ||L||)+1n
4. G: {s:(n List)| ||s|| = 1 & (x,y:||s||. x < y s[x] < s[y]) }||L||
c:||L||, f:(L[c]n). increasing(f;L[c]) & (s:L[c] List. ||s|| = 1 (x,y:||s||. x < y s[x] < s[y]) G(map(f;s)) = c)
29 steps

About:
listintnatural_numberaddsubtractless_than
functionequalimpliesall
exists

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