---

Step * of Lemma hdf-parallel_wf

∀[A,B:Type]. ∀[X,Y:hdataflow(A;B)].  X || Y ∈ hdataflow(A;B) supposing valueall-type(B)
BY
{ ProveWfLemma }

---

Latex:


\mforall{}[A,B:Type].  \mforall{}[X,Y:hdataflow(A;B)].    X  ||  Y  \mmember{}  hdataflow(A;B)  supposing  valueall-type(B)


By

ProveWfLemma

---

Home Index