---

Step * of Lemma once-class-program-eq-hdf

∀[Info,B:Type]. ∀[pr1,pr2:Id ⟶ hdataflow(Info;B)].
  once-class-program(pr1) = once-class-program(pr2) ∈ (Id ⟶ hdataflow(Info;B)) 
  supposing pr1 = pr2 ∈ (Id ⟶ hdataflow(Info;B))
BY
{ (Auto THEN RepUR ``once-class-program`` 0 THEN EqCD THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[Info,B:Type].  \mforall{}[pr1,pr2:Id  {}\mrightarrow{}  hdataflow(Info;B)].
    once-class-program(pr1)  =  once-class-program(pr2)  supposing  pr1  =  pr2


By

---

Latex:
(Auto  THEN  RepUR  ``once-class-program``  0  THEN  EqCD  THEN  Auto)

---

Home Index