a1,a2:A. f(a1) = f(a2) 
B 
a1 = a2A,B:Type, f:(A
B). Inj(A; B; f) Prop
} == {k:
| i 
k < j }m,n:. {m..n} Type
== {i:| 0i } Type
b T == 
a = b TA:Type, x,y:A. (x y) PropA == A FalseA:Prop. (A) Prop| Some definitions of interest. | |
| inject | a1,a2:A. f(a1) = f(a2) B a1 = a2 |
| A,B:Type, f:(AB). Inj(A; B; f) Prop | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| nat | == {i:| 0i } |
| Type | |
| nequal | b T == a = b T |
| A:Type, x,y:A. (x y) Prop | |
| not | A == A False |
| A:Prop. (A) Prop |
About:
 |  |  |  |  |  |
 |  |  |  |  |  |
 |