---

Step * of Lemma state-class1-program_wf

∀[Info,A,B:Type]. ∀[init:Id ⟶ B]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[X:EClass(A)]. ∀[pr:LocalClass(X)].
  (state-class1-program(init;f;pr) ∈ LocalClass(state-class1(init;f;X))) supposing (valueall-type(B) and (↓B))
BY
{ (Auto
   THEN RepUR ``state-class1-program state-class1`` 0
   THEN Auto
   THEN SquashExRepD
   THEN D 0
   THEN Unfold `exists` 0
   THEN Auto
   THEN BLemma `valueall-type-value-type`
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[init:Id  {}\mrightarrow{}  B].  \mforall{}[f:Id  {}\mrightarrow{}  A  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[X:EClass(A)].  \mforall{}[pr:LocalClass(X)].
    (state-class1-program(init;f;pr)  \mmember{}  LocalClass(state-class1(init;f;X)))  supposing 
          (valueall-type(B)  and 
          (\mdownarrow{}B))


By

---

Latex:
(Auto
  THEN  RepUR  ``state-class1-program  state-class1``  0
  THEN  Auto
  THEN  SquashExRepD
  THEN  D  0
  THEN  Unfold  `exists`  0
  THEN  Auto
  THEN  BLemma  `valueall-type-value-type`
  THEN  Auto)

---

Home Index