---

Step * of Lemma absolutelyfree-unique

∀[T,S:Type].  (absolutelyfree{i:l}(T) ⇒ absolutelyfree{i:l}(S) ⇒ T ≡ S)
BY
{ (Auto THEN D -2 THEN D -1 THEN D 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T,S:Type].    (absolutelyfree\{i:l\}(T)  {}\mRightarrow{}  absolutelyfree\{i:l\}(S)  {}\mRightarrow{}  T  \mequiv{}  S)


By

---

Latex:
(Auto  THEN  D  -2  THEN  D  -1  THEN  D  0  THEN  Auto)

---

Home Index