---

Step * of Lemma Memory-loc-class-exists

∀[Info,B,A:Type]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)]. ∀[X:EClass(A)]. ∀[es:EO+(Info)]. ∀[e:E].
  ↓∃v:B. v ∈ Memory-loc-class(f;init;X)(e) supposing 0 < #(init loc(e))
BY
{ (Auto
   THEN (InstLemma `Memory-class-exists` [⌜Info⌝;⌜B⌝;⌜A⌝;⌜f loc(e)⌝;⌜init⌝;⌜X⌝;⌜es⌝;⌜e⌝]⋅ THENA Auto)
   THEN SquashExRepD
   THEN D 0
   THEN (InstConcl [⌜v⌝]⋅ THENA Auto)
   THEN BLemma `Memory-classrel-loc`
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[Info,B,A:Type].  \mforall{}[f:Id  {}\mrightarrow{}  A  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[init:Id  {}\mrightarrow{}  bag(B)].  \mforall{}[X:EClass(A)].  \mforall{}[es:EO+(Info)].
\mforall{}[e:E].
    \mdownarrow{}\mexists{}v:B.  v  \mmember{}  Memory-loc-class(f;init;X)(e)  supposing  0  <  \#(init  loc(e))


By

---

Latex:
(Auto
  THEN  (InstLemma  `Memory-class-exists`  [\mkleeneopen{}Info\mkleeneclose{};\mkleeneopen{}B\mkleeneclose{};\mkleeneopen{}A\mkleeneclose{};\mkleeneopen{}f  loc(e)\mkleeneclose{};\mkleeneopen{}init\mkleeneclose{};\mkleeneopen{}X\mkleeneclose{};\mkleeneopen{}es\mkleeneclose{};\mkleeneopen{}e\mkleeneclose{}]\mcdot{}  THENA  Auto)
  THEN  SquashExRepD
  THEN  D  0
  THEN  (InstConcl  [\mkleeneopen{}v\mkleeneclose{}]\mcdot{}  THENA  Auto)
  THEN  BLemma  `Memory-classrel-loc`
  THEN  Auto)

---

Home Index