| | Who Cites array-count? |
|
| array-count | Def array-count(v.P(v);a) == sum(if P(a[i]) 1 else 0 fi | i < |a|) |
|
| array-select | Def a[i] == 2of(a)(i) |
|
| array-length | Def |a| == 1of(a) |
|
| sum | Def sum(f(x) | x < k) == primrec(k;0; x,n. n+f(x)) |
| | | Thm*  n: , f:(n   ). sum(f(x) | x < n)  |
|
| pi2 | Def 2of(t) == t.2 |
| | | Thm* A:Type, B:(AType), p:(a:A B(a)). 2of(p) B(1of(p)) |
|
| pi1 | Def 1of(t) == t.1 |
| | | Thm* A:Type, B:(AType), p:(a:AB(a)). 1of(p) A |
|
| primrec | Def primrec(n;b;c) == if n= 0 b else c(n-1,primrec(n-1;b;c)) fi (recursive) |
| | | Thm* T:Type, n:, b:T, c:(nTT). primrec(n;b;c) T |
|
| eq_int | Def i=j == if i=j true ; false fi |
| | | Thm* i,j:. (i=j)  |
