Thms
array
1
Doc
int_upper
Def
{i...} == {j:
| i
j}
Thm*
n:
. {n...}
Type
int_seg
Def
{i..j
} == {k:
| i
k < j}
Thm*
m,n:
. {m..n
}
Type
function_prim
Def x:A
B(x) == PRIMITIVE {Total functions from A:
x.b(x) such that b(x)
B(x) for x
A }
lelt
Def
i
j < k == i
j & j < k
le
Def
A
B ==
B < A
Thm*
i,j:
. i
j
Prop
not
Def
A == A
False
Thm* (
A)
Prop