== {i:
| 0
i } 
TypeB == 
B < A
i,j:. (ij) PropA == A 
FalseA:Prop. (A) Prop
j
[i / upto(i+1;j)] else nil fi (recursive)i,j:. upto(i;j) {i..j
} List| Some definitions of interest. | |
| nat | Def == {i:| 0i } |
| Thm* Type | |
| le | Def AB == B < A |
| Thm* i,j:. (ij) Prop | |
| not | Def A == A False |
| Thm* A:Prop. (A) Prop | |
| upto | Def upto(i;j) == if i < j [i / upto(i+1;j)] else nil fi (recursive) |
| Thm* i,j:. upto(i;j) {i..j} List |
About:
 |  |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |