| | Some definitions of interest. |
|
| deq | Def EqDecider(T) == eq:T  T   x,y:T. x = y    (eq(x,y)) |
| | | Thm* T:Type. EqDecider(T)  Type |
|
| assert | Def b == if b True else False fi |
| | | Thm* b:. b Prop |
|
| fpf-dom | Def x dom(f) == deq-member(eq;x;1of(f)) |
|
| deq-member | Def deq-member(eq;x;L) == reduce( a,b. eqof(eq)(a,x)   b;false;L) |
|
| fpf | Def a:A fp-> B(a) == d:A Lista:{a:A| (a d) }B(a) |
| | | Thm* A:Type, B:(AType). a:A fp-> B(a) Type |
|
| fpf-ap | Def f(x) == 2of(f)(x) |
|
| l_member | Def (x l) ==  i: . i<||l|| & x = l[i] T |
| | | Thm* T:Type, x:T, l:T List. (x l) Prop |
|
| pi1 | Def 1of(t) == t.1 |
| | | Thm* A:Type, B:(AType), p:(a:AB(a)). 1of(p) A |
