---

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

∀[f:Name ⟶ Type]. ∀[hdr:Name]. ∀[T:Type].
  base-class-program(hdr) ∈ Id ⟶ hdataflow(Message(f);T) supposing hdr encodes T
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[f:Name  {}\mrightarrow{}  Type].  \mforall{}[hdr:Name].  \mforall{}[T:Type].
    base-class-program(hdr)  \mmember{}  Id  {}\mrightarrow{}  hdataflow(Message(f);T)  supposing  hdr  encodes  T


By

---

Latex:
ProveWfLemma

---

Home Index