Nuprl Lemma : run-msg-commands_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. (run-msg-commands(r) ∈ Type)
Proof
Definitions occuring in Statement :
run-msg-commands: run-msg-commands(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,
run-msg-commands: run-msg-commands(r),
and: P ∧ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
pInTransit: pInTransit(P.M[P]),
pi2: snd(t)
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. (run-msg-commands(r) \mmember{} Type)
Date html generated:
2016_05_17-AM-10_56_19
Last ObjectModification:
2015_12_29-PM-05_17_43
Theory : process-model
Home
Index