---

Step * of Lemma Memory1-memory-class1

∀[Info,A,B:Type]. ∀[init:Id ⟶ B]. ∀[tr:Id ⟶ A ⟶ B ⟶ B]. ∀[X:EClass(A)].
  (Memory1(init;tr;X) = memory-class1(initially initapplying tron X) ∈ EClass(B))
BY
{ (Auto
   THEN Unfold `Memory1` 0
   THEN RWO "Memory-loc-class-is-prior-State-loc-comb" 0
   THEN Auto
   THEN Fold `State1` 0
   THEN (RWO "State1-state-class1" 0 THENA Auto)
   THEN Unfolds ``state-class1 memory-class1`` 0
   THEN Symmetry
   THEN BLemma `loop-class-memory-is-prior-loop-class-state`
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[init:Id  {}\mrightarrow{}  B].  \mforall{}[tr:Id  {}\mrightarrow{}  A  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[X:EClass(A)].
    (Memory1(init;tr;X)  =  memory-class1(initially  initapplying  tron  X))


By

---

Latex:
(Auto
  THEN  Unfold  `Memory1`  0
  THEN  RWO  "Memory-loc-class-is-prior-State-loc-comb"  0
  THEN  Auto
  THEN  Fold  `State1`  0
  THEN  (RWO  "State1-state-class1"  0  THENA  Auto)
  THEN  Unfolds  ``state-class1  memory-class1``  0
  THEN  Symmetry
  THEN  BLemma  `loop-class-memory-is-prior-loop-class-state`
  THEN  Auto)

---

Home Index