i}(x) == if i=
0
x else f(f{i-1}(x)) fi (recursive)
f:(A
A), i:
. f{i} 
AAx:A. g(f(x)) = x) & (y:B. f(g(y)) = y)f:(AB), g:(BA). InvFuns(A;B;f;g) Prop == {i:
| 0
i } Type| 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 | |
| inv_funs_2 | x:A. g(f(x)) = x) & (y:B. f(g(y)) = y) |
| f:(AB), g:(BA). InvFuns(A;B;f;g) Prop | |
| nat | == {i:| 0i } |
| Type |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |
 |