| Some definitions of interest. |
|
hselect | Def select == p:'a  . @ x:'a. (p(x)) |
| | Thm* 'a:S. select (('a  hbool)  'a) |
|
bchoose | Def @ x:'a. p(x) == @x:'a. p(x) |
| | Thm* 'a:S, p:('a  ). (@ x:'a. p(x)) 'a |
|
hall | Def all == p:'a  .  x:'a. (p(x)) |
| | Thm* 'a:S. all (('a  hbool)  hbool) |
|
assert | Def b == if b True else False fi |
| | Thm* b: . b Prop |
|
hequal | Def equal == x:'a. y:'a. x = y |
| | Thm* 'a:S. equal ('a  'a  hbool) |
|
bequal | Def x = y ==  (x = y T) |
| | Thm* T:Type, x,y:T. (x = y)  |
|
hcond | Def cond == b: . p:'a. q:'a. if b then p else q fi |
| | Thm* 'a:S. cond (hbool  'a  'a  'a) |
|
hpre | Def pre == n: . pre(n) |
| | Thm* pre (hnum  hnum) |
|
pre | Def pre(n) == if n= 0 then 0 else n-1 fi |
| | Thm* n: . pre(n)  |
|
bif | Def bif(b; bx.x(bx); by.y(by)) == if b x(*) else y( x.x) fi |
| | Thm* A:Type, b: , x:(b A), y:(( b) A). bif(b; bx.x(bx); by.y(by)) A |
|
eq_int | Def i= j == if i=j true ; false fi |
| | Thm* i,j: . (i= j)  |
|
hnum | Def hnum ==  |
| | Thm* hnum S |
|
hsuc | Def suc == n: . n+1 |
| | Thm* suc (hnum  hnum) |
|
label | Def t ...$L == t |
|
nat | Def == {i: | 0 i } |
| | Thm* Type |
| | Thm* S |
|
tlambda | Def ( x:T. b(x))(x) == b(x) |