---

Step * of Lemma hdf-bind-gen_wf

∀[A,B,C:Type]. ∀[X:hdataflow(A;B)]. ∀[Y:B ─→ hdataflow(A;C)]. ∀[hdfs:bag(hdataflow(A;C))].
  X (hdfs) >>= Y ∈ hdataflow(A;C) supposing valueall-type(C)
BY
{ ProveWfLemma }

---

Latex:


\mforall{}[A,B,C:Type].  \mforall{}[X:hdataflow(A;B)].  \mforall{}[Y:B  {}\mrightarrow{}  hdataflow(A;C)].  \mforall{}[hdfs:bag(hdataflow(A;C))].
    X  (hdfs)  >>=  Y  \mmember{}  hdataflow(A;C)  supposing  valueall-type(C)


By

ProveWfLemma

---

Home Index