Nuprl Lemma : process-has-value
∀[M,E:Type ─→ Type]. ∀[P:process(P.M[P];P.E[P])]. (P)↓ supposing M[Top]
Proof
Definitions occuring in Statement :
process: process(P.M[P];P.E[P]),
has-value: (a)↓,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type
Lemmas :
process-valueall-type,
value-type-has-value,
valueall-type-value-type,
process_wf,
top_wf
\mforall{}[M,E:Type {}\mrightarrow{} Type]. \mforall{}[P:process(P.M[P];P.E[P])]. (P)\mdownarrow{} supposing M[Top]
Date html generated:
2015_07_17-AM-11_19_43
Last ObjectModification:
2015_01_28-AM-07_35_14
Home
Index