Nuprl Lemma : run-event-step_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[e:runEvents(r)]. (run-event-step(e) ∈ ℕ)
Proof
Definitions occuring in Statement :
run-event-step: run-event-step(e),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
nat: ℕ,
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,
run-event-step: run-event-step(e),
runEvents: runEvents(r),
pi1: fst(t),
pi2: snd(t),
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. \mforall{}[e:runEvents(r)]. (run-event-step(e) \mmember{} \mBbbN{})
Date html generated:
2016_05_17-AM-10_43_28
Last ObjectModification:
2015_12_29-PM-05_23_15
Theory : process-model
Home
Index