b == if b
True else False fi
b:
. b 
Prop
0 then 0 else n-1 fi n:
. pre(n) j == if i=j true ; false fii,j:
. (i=j) == {i:| 0
i } Type SB == 
B<Ai,j:. (ij) PropA == A 
FalseA:Prop. (A) Prop| Some definitions of interest. | |
| assert | b == if b True else False fi |
| b:. b Prop | |
| pre | 0 then 0 else n-1 fi |
| n:. pre(n) | |
| eq_int | j == if i=j true ; false fi |
| i,j:. (i=j) | |
| nat | == {i:| 0i } |
| Type | |
| S | |
| le | B == B<A |
| i,j:. (ij) Prop | |
| not | A == A False |
| A:Prop. (A) Prop |
About:
 |  |  |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |  |