x
L.P(x) == (letrec list_all L = (Case of L; nil 
True ; h.t P(h) & list_all(t)) ) (L)T:Type, P:(T
Prop), L:T List. xL.P(x) TypeT:Type, P:(TType). xnil.P(x) Type
P 
PA:Prop. SqStable(A) PropT == {:True| T }A:Prop. A Prop| Who Cites list all? | |
| 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:(TProp), L:T List. xL.P(x) Type | |
| Thm* T:Type, P:(TType). xnil.P(x) Type | |
| sq_stable | Def SqStable(P) == P P |
| Thm* A:Prop. SqStable(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) |
| squash | Def T == {:True| T } |
| Thm* A:Prop. A Prop |
About:
 |  |  |
 |  |  |  |  |
 |  |  |  |  |  |  |