| | Who Cites decidable? |
|
| decidable | Def Dec(P) == P   P |
| | | Thm*  A:Prop. Dec(A)  Prop |
|
| list_all | Def xL.P(x) == (letrec list_all L = (Case of L; nil  True ; h.t P(h) & list_all(t)) ) (L) |
| | | Thm* T:Type, P:(T  Prop), L:T List. xL.P(x) Type |
| | | Thm* T:Type, P:(TType). xnil.P(x) Type |
|
| list_exists | Def  xL.P(x) == (letrec list_exists L = (Case of L; nil False ; h.t P(h) list_exists(t)) ) (L) |
| | | Thm* T:Type, P:(TProp), L:T List. xL.P(x) Type |
|
| not | Def A == A   False |
| | | Thm* A:Prop. (A) Prop |
|
| letrec_body | Def = b == b |
|
| letrec_arg | Def x b(x) (x) == b(x) |
|
| letrec | Def (letrec f b(f)) == b((letrec f b(f)) ) (recursive) |
