---

Step * of Lemma shorter-proof-of-termination-equality

∀[T:Type]. ∀[x,y:partial(T)].  x = y ∈ T supposing (x)↓ ∧ (x = y ∈ partial(T)) supposing value-type(T)
BY
{ (Intros
   THEN D -1
   THEN (PointwiseFunctionalityForEquality (-4) THENA Auto)
   THEN (PointwiseFunctionalityForEquality (-3) THENA Auto)
   THEN BLemma  `termination-equality-base`
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[x,y:partial(T)].    x  =  y  supposing  (x)\mdownarrow{}  \mwedge{}  (x  =  y)  supposing  value-type(T)


By

---

Latex:
(Intros
  THEN  D  -1
  THEN  (PointwiseFunctionalityForEquality  (-4)  THENA  Auto)
  THEN  (PointwiseFunctionalityForEquality  (-3)  THENA  Auto)
  THEN  BLemma    `termination-equality-base`
  THEN  Auto)

---

Home Index