---

Step * of Lemma hdf-state_wf

∀[A,B:Type]. ∀[X:hdataflow(A;B ─→ B)]. ∀[bs:bag(B)].  hdf-state(X;bs) ∈ hdataflow(A;B) supposing valueall-type(B)
BY
{ (Auto THEN Unfold `hdf-state` 0 THEN Using [`S',⌈hdataflow(A;B ─→ B) × bag(B)⌉] MemCD⋅ THEN Auto)⋅ }

---

Latex:


\mforall{}[A,B:Type].  \mforall{}[X:hdataflow(A;B  {}\mrightarrow{}  B)].  \mforall{}[bs:bag(B)].
    hdf-state(X;bs)  \mmember{}  hdataflow(A;B)  supposing  valueall-type(B)


By

(Auto  THEN  Unfold  `hdf-state`  0  THEN  Using  [`S',\mkleeneopen{}hdataflow(A;B  {}\mrightarrow{}  B)  \mtimes{}  bag(B)\mkleeneclose{}]  MemCD\mcdot{}  THEN  Auto)\mcdot{}

---

Home Index