At:
trivial-arrows
1
2
1
1.
k: 
2.
L:
List
3.
n:
.
k-1
n

(
G:({s:(
n List)| ||s|| = k
& (
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|| = k

(
x,y:
||s||. x < y 
s[x] < s[y]) 
G(map(f;s)) = c))
4.
c:
||L||
5.
f:
L[c]

(k-1)
6.
increasing(f;L[c])
7.
s:
L[c] List. ||s|| = k

(
x,y:
||s||. x < y 
s[x] < s[y]) 
(
s.
)(map(f;s)) = c
L[c] < k
By:
Inst
Thm*
n,m:
, f:(
n

m). Inj(
n;
m; f) 
n
m
[L[c];k-1;f]
THEN
BackThru
Thm*
k,m:
, f:(
k

m). increasing(f;k) 
Inj(
k;
m; f)
Generated subgoals:
None
About: