---

Step * of Lemma hdf-prior_wf

∀[A,B:Type]. ∀[X:hdataflow(A;B)]. ∀[b:bag(B)].  hdf-prior(X;b) ∈ hdataflow(A;B) supposing (↓B) ∧ valueall-type(B)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[A,B:Type].  \mforall{}[X:hdataflow(A;B)].  \mforall{}[b:bag(B)].
    hdf-prior(X;b)  \mmember{}  hdataflow(A;B)  supposing  (\mdownarrow{}B)  \mwedge{}  valueall-type(B)


By

---

Latex:
ProveWfLemma

---

Home Index