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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
has-value: (a)↓
Latex:
\mforall{}[M,E:Type {}\mrightarrow{} Type]. \mforall{}[P:process(P.M[P];P.E[P])]. (P)\mdownarrow{} supposing M[Top]
Date html generated:
2016_05_16-AM-11_43_10
Last ObjectModification:
2015_12_29-AM-09_36_08
Theory : event-ordering
Home
Index