---

Step * of Lemma absolutelyfree-subtype

∀[T:Type]. T ⊆r (ℕ ⟶ ℕ) supposing absolutelyfree{i:l}(T)
BY
{ Auto }

---

Latex:

---

Latex:
\mforall{}[T:Type].  T  \msubseteq{}r  (\mBbbN{}  {}\mrightarrow{}  \mBbbN{})  supposing  absolutelyfree\{i:l\}(T)


By

---

Latex:
Auto

---

Home Index