---

Step * of Lemma evalall-reduce

∀[T:Type]. ∀[t:T].  evalall(t) ~ t supposing valueall-type(T)
BY
{ (Auto
   THEN Unfold `valueall-type` (-1)
   THEN PointwiseFunctionality 2
   THEN Try (Complete ((BLemma `evalall-sqequal` THEN Auto)))
   THEN (InstHyp [⌜a⌝] 5⋅ THEN Auto)
   THEN InstHyp [⌜b⌝] 5⋅
   THEN Auto
   THEN (RWO "evalall-sqequal" 0 THEN Auto)
   THEN Refine_sqequalExtensionalEquality
   THEN D 0
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[t:T].    evalall(t)  \msim{}  t  supposing  valueall-type(T)


By

---

Latex:
(Auto
  THEN  Unfold  `valueall-type`  (-1)
  THEN  PointwiseFunctionality  2
  THEN  Try  (Complete  ((BLemma  `evalall-sqequal`  THEN  Auto)))
  THEN  (InstHyp  [\mkleeneopen{}a\mkleeneclose{}]  5\mcdot{}  THEN  Auto)
  THEN  InstHyp  [\mkleeneopen{}b\mkleeneclose{}]  5\mcdot{}
  THEN  Auto
  THEN  (RWO  "evalall-sqequal"  0  THEN  Auto)
  THEN  Refine\_sqequalExtensionalEquality
  THEN  D  0
  THEN  Auto)

---

Home Index