---

Step * of Lemma even-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 ChangeEquality ⌜partial(T)⌝ ⋅ THEN Auto THEN BLemma `termination` 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  ChangeEquality  \mkleeneopen{}partial(T)\mkleeneclose{}  \mcdot{}  THEN  Auto  THEN  BLemma  `termination`  THEN  Auto)

---

Home Index