} == {k:
| i 
k < j }
m,n:. {m..n} 
Type
== {i:| 0i } TypeB == 
B<Ai,j:. (ij) Prop
j
f(i)-1 else f(i) fia,b:, f:({a..b}
), j:{a..b}.
Thm* 0<f(j)
reduce_factorization(f; j) {a..b}| Some definitions of interest. | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| nat | == {i:| 0i } |
| Type | |
| le | B == B<A |
| i,j:. (ij) Prop | |
| reduce_factorization | j f(i)-1 else f(i) fi |
| a,b:, f:({a..b}), j:{a..b}.
Thm* 0<f(j) reduce_factorization(f; j) {a..b} |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |