---

Step * of Lemma run-initialization_wf

∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[G:LabeledGraph(pInTransit(P.M[P]))].  (run-initialization(r;G) ∈ ℙ)
BY
{ ProveWfLemma }

---

Latex:

---

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{})


By

---

Latex:
ProveWfLemma

---

Home Index