i}(x) == if i=
0
x else f(f{i-1}(x)) fi (recursive)
f:(A
A), i:
. f{i} 
AA == {i:
| 0
i } Typeb:B. 
a:A. f(a) = bA,B:Type, f:(AB). Surj(A; B; f) Prop| Some definitions of interest. | |
| compose_iter | i}(x) == if i=0 x else f(f{i-1}(x)) fi (recursive) |
| f:(AA), i:. f{i} AA | |
| nat | == {i:| 0i } |
| Type | |
| surject | b:B. a:A. f(a) = b |
| A,B:Type, f:(AB). Surj(A; B; f) Prop |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |
 |