x,y:T. 
(x eq y) 
x = yT:Type, eq:(T
T
). IsEqFun(T;eq) 
Propb == if b
True else False fib:. b Prop
} == {k:
| i 
k < j }m,n:. {m..n} Type
== {i:| 0i } Typeb:B. 
a:A. f(a) = bA,B:Type, f:(AB). Surj(A; B; f) Prop| Some definitions of interest. | |
| eqfun_p | x,y:T. (x eq y) x = y |
| T:Type, eq:(TT). IsEqFun(T;eq) Prop | |
| assert | b == if b True else False fi |
| b:. b Prop | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| nat | == {i:| 0i } |
| Type | |
| surject | b:B. a:A. f(a) = b |
| A,B:Type, f:(AB). Surj(A; B; f) Prop |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |  |