Nuprl Lemma : process_wf
∀[M,E:Type ⟶ Type].  (process(P.M[P];P.E[P]) ∈ Type)
Proof
Definitions occuring in Statement : 
process: process(P.M[P];P.E[P])
, 
uall: ∀[x:A]. B[x]
, 
so_apply: x[s]
, 
member: t ∈ T
, 
function: x:A ⟶ B[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
process: process(P.M[P];P.E[P])
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
Latex:
\mforall{}[M,E:Type  {}\mrightarrow{}  Type].    (process(P.M[P];P.E[P])  \mmember{}  Type)
Date html generated:
2016_05_16-AM-11_42_50
Last ObjectModification:
2015_12_29-AM-09_35_09
Theory : event-ordering
Home
Index