Nuprl Lemma : run-lt_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. (run-lt(r) ∈ runEvents(r) ⟶ runEvents(r) ⟶ ℙ)
Proof
Definitions occuring in Statement :
run-lt: run-lt(r),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
uall: ∀[x:A]. B[x],
prop: ℙ,
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,
run-lt: run-lt(r),
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. (run-lt(r) \mmember{} runEvents(r) {}\mrightarrow{} runEvents(r) {}\mrightarrow{} \mBbbP{})
Date html generated:
2016_05_17-AM-10_50_12
Last ObjectModification:
2015_12_29-PM-05_20_45
Theory : process-model
Home
Index