---

Step * of Lemma per-computes-to_wf

∀[Term:{T:Type| T ⊆r Base} ]. ∀[a,b:Term].  (per-computes-to(Term;a;b) ∈ Type)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[Term:\{T:Type|  T  \msubseteq{}r  Base\}  ].  \mforall{}[a,b:Term].    (per-computes-to(Term;a;b)  \mmember{}  Type)


By

---

Latex:
ProveWfLemma

---

Home Index