i}(x) == if i=
0
x else f(f{i-1}(x)) fi (recursive)
f:(A
A), i:
. f{i} 
AAa1,a2:A. f(a1) = f(a2) B 
a1 = a2A,B:Type, f:(AB). Inj(A; B; f) Prop == {i:
| 0
i } Type
A == A FalseA:Prop. (A) 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 | |
| inject | a1,a2:A. f(a1) = f(a2) B a1 = a2 |
| A,B:Type, f:(AB). Inj(A; B; f) Prop | |
| nat | == {i:| 0i } |
| Type | |
| not | A == A False |
| A:Prop. (A) Prop |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |
 |