---

Step * of Lemma callbyvalueall_seq-shift-init0

∀[L,F,K:Top]. ∀[m,n,p:ℕ].
  (callbyvalueall_seq(L;λf.mk_applies(f;K;p);F;n;m) 
  ~ callbyvalueall_seq(λi.mk_applies(L i;K;p);λx.x;λg.(F (λf.(g mk_applies(f;K;p))));n;m))
BY
{ ((UnivCD THENA Auto)
   THEN (InstLemma `callbyvalueall_seq-shift-init` [⌜L⌝;⌜F⌝;⌜K⌝;⌜m⌝;⌜n⌝;⌜p⌝;⌜0⌝]⋅ THENA Auto)
   THEN (Subst ⌜p + 0 ~ p⌝ (-1)⋅ THENA Auto)
   THEN RWO "-1" 0
   THEN Auto
   THEN RepUR ``mk_applies`` 0
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[L,F,K:Top].  \mforall{}[m,n,p:\mBbbN{}].
    (callbyvalueall\_seq(L;\mlambda{}f.mk\_applies(f;K;p);F;n;m) 
    \msim{}  callbyvalueall\_seq(\mlambda{}i.mk\_applies(L  i;K;p);\mlambda{}x.x;\mlambda{}g.(F  (\mlambda{}f.(g  mk\_applies(f;K;p))));n;m))


By

---

Latex:
((UnivCD  THENA  Auto)
  THEN  (InstLemma  `callbyvalueall\_seq-shift-init`  [\mkleeneopen{}L\mkleeneclose{};\mkleeneopen{}F\mkleeneclose{};\mkleeneopen{}K\mkleeneclose{};\mkleeneopen{}m\mkleeneclose{};\mkleeneopen{}n\mkleeneclose{};\mkleeneopen{}p\mkleeneclose{};\mkleeneopen{}0\mkleeneclose{}]\mcdot{}  THENA  Auto)
  THEN  (Subst  \mkleeneopen{}p  +  0  \msim{}  p\mkleeneclose{}  (-1)\mcdot{}  THENA  Auto)
  THEN  RWO  "-1"  0
  THEN  Auto
  THEN  RepUR  ``mk\_applies``  0
  THEN  Auto)

---

Home Index