---

Step * of Lemma class-at-program-wf-hdf

∀[A,B:Type]. ∀[pr:Id ⟶ hdataflow(A;B)]. ∀[locs:bag(Id)].  (pr)@locs ∈ Id ⟶ hdataflow(A;B) supposing valueall-type(B)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[A,B:Type].  \mforall{}[pr:Id  {}\mrightarrow{}  hdataflow(A;B)].  \mforall{}[locs:bag(Id)].
    (pr)@locs  \mmember{}  Id  {}\mrightarrow{}  hdataflow(A;B)  supposing  valueall-type(B)


By

---

Latex:
ProveWfLemma

---

Home Index