Nuprl Lemma : run-initialization_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[G:LabeledGraph(pInTransit(P.M[P]))]. (run-initialization(r;G) ∈ ℙ)
Proof
Definitions occuring in Statement :
run-initialization: run-initialization(r;G),
pRunType: pRunType(T.M[T]),
pInTransit: pInTransit(P.M[P]),
labeled-graph: LabeledGraph(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-initialization: run-initialization(r;G),
so_lambda: λ2x.t[x],
so_apply: x[s],
pInTransit: pInTransit(P.M[P]),
pi1: fst(t)
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])]. \mforall{}[G:LabeledGraph(pInTransit(P.M[P]))].
(run-initialization(r;G) \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-10_51_15
Last ObjectModification:
2015_12_29-PM-05_20_02
Theory : process-model
Home
Index