0
Unit ; n=1 A else A
(A^(n-1)) fi (recursive)
A:Type, n:
. (A^n) 
Typej == if i=j true ; false fii,j:
. (i=j) 
== {i:| 0
i } Type
b T == 
a = b TA:Type, x,y:A. (x y) Prop| Some definitions of interest. | |
| sfa_doc_ntuple | 0 Unit ; n=1 A else A(A^(n-1)) fi (recursive) |
| A:Type, n:. (A^n) Type | |
| eq_int | j == if i=j true ; false fi |
| i,j:. (i=j) | |
| nat | == {i:| 0i } |
| Type | |
| nequal | b T == a = b T |
| A:Type, x,y:A. (x y) Prop |
About:
 |  |  |  |  |  |  |
 |  |  |  |
 |  |  |  |  |  |
 |