Nuprl Lemma : run-lt-transitive
∀[M:Type ⟶ Type]. ∀r:pRunType(P.M[P]). Trans(runEvents(r);x,y.x run-lt(r) y)
Proof
Definitions occuring in Statement :
run-lt: run-lt(r),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
trans: Trans(T;x,y.E[x; y]),
uall: ∀[x:A]. B[x],
infix_ap: x f y,
so_apply: x[s],
all: ∀x:A. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
run-lt: run-lt(r),
member: t ∈ T,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}r:pRunType(P.M[P]). Trans(runEvents(r);x,y.x run-lt(r) y)
Date html generated:
2016_05_17-AM-10_50_51
Last ObjectModification:
2015_12_29-PM-05_20_08
Theory : process-model
Home
Index