| Some definitions of interest. |
|
nat | Def == {i:| 0i } |
| | Thm* Type |
|
le | Def AB == B<A |
| | Thm* i,j:. (ij) Prop |
|
let | Def let x = a in b(x) == (x.b(x))(a) |
| | Thm* A,B:Type, a:A, b:(AB). let x = a in b(x) B |
|
sym | Def Sym x,y:T. E(x;y) == a,b:T. E(a;b) E(b;a) |
| | Thm* T:Type, E:(TTProp). (Sym x,y:T. E(x,y)) Prop |
|
wellfounded | Def WellFnd{i}(A;x,y.R(x;y))
Def == P:(AProp). (j:A. (k:A. R(k;j) P(k)) P(j)) {n:A. P(n)} |
| | Thm* A:Type{i}, r:(AAProp{i}). WellFnd{i}(A;x,y.r(x,y)) Prop{i'} |