---

Step * of Lemma process-equiv_wf

∀[M:Type ─→ Type]. ∀[P,Q:Process(T.M[T])].  (P≡Q ∈ ℙ) supposing Continuous+(T.M[T])
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[P,Q:Process(T.M[T])].    (P\mequiv{}Q  \mmember{}  \mBbbP{})  supposing  Continuous+(T.M[T])


By

---

Latex:
ProveWfLemma

---

Home Index