Nuprl Lemma : runEvents_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. (runEvents(r) ∈ Type)
Proof
Definitions occuring in Statement :
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
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,
runEvents: runEvents(r),
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
prop: ℙ
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. (runEvents(r) \mmember{} Type)
Date html generated:
2016_05_17-AM-10_42_04
Last ObjectModification:
2015_12_29-PM-05_24_15
Theory : process-model
Home
Index