---

Step * of Lemma memory-class2-program_wf

∀[Info,A1,A2,B:Type]. ∀[init:Id ⟶ B]. ∀[tr1:Id ⟶ A1 ⟶ B ⟶ B]. ∀[X1:EClass(A1)]. ∀[pr1:LocalClass(X1)]. ∀[tr2:Id
                                                                                                                 ⟶ A2
                                                                                                                 ⟶ B
                                                                                                                 ⟶ B].
∀[X2:EClass(A2)]. ∀[pr2:LocalClass(X2)].
  (memory-class2-program(init;tr1;pr1;tr2;pr2) ∈ LocalClass(memory-class2(init;tr1;X1;tr2;X2))) supposing 
     (valueall-type(A1) and 
     valueall-type(A2) and 
     valueall-type(B) and 
     (↓B))
BY
{ (Auto
   THEN RepUR ``memory-class2-program memory-class2`` 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,A1,A2,B:Type].  \mforall{}[init:Id  {}\mrightarrow{}  B].  \mforall{}[tr1:Id  {}\mrightarrow{}  A1  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[X1:EClass(A1)].
\mforall{}[pr1:LocalClass(X1)].  \mforall{}[tr2:Id  {}\mrightarrow{}  A2  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[X2:EClass(A2)].  \mforall{}[pr2:LocalClass(X2)].
    (memory-class2-program(init;tr1;pr1;tr2;pr2)
      \mmember{}  LocalClass(memory-class2(init;tr1;X1;tr2;X2)))  supposing 
          (valueall-type(A1)  and 
          valueall-type(A2)  and 
          valueall-type(B)  and 
          (\mdownarrow{}B))


By

---

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

---

Home Index