i}(x) == if i=
0
x else f(f{i-1}(x)) fi (recursive)
f:(A
A), i:
. f{i} 
AAj == if i=j true ; false fii,j:
. (i=j) 
b T == 
a = b TA:Type, x,y:A. (x y) 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 | |
| eq_int | j == if i=j true ; false fi |
| i,j:. (i=j) | |
| nequal | b T == a = b T |
| A:Type, x,y:A. (x y) Prop |
About:
 |  |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |