---

Step * of Lemma dataflow-equiv_wf

∀[A,B:Type]. ∀[f,g:dataflow(A;B)].  (f ≡ g ∈ ℙ)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[A,B:Type].  \mforall{}[f,g:dataflow(A;B)].    (f  \mequiv{}  g  \mmember{}  \mBbbP{})


By

---

Latex:
ProveWfLemma

---

Home Index