---

Step * of Lemma wqo-less_wf

∀[T:Type]. ∀[R:T ⟶ T ⟶ ℙ]. ∀[bs,as:n:ℕ × (ℕn ⟶ T)].  (wqo-less(T;x,y.R[x;y];bs;as) ∈ ℙ)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[R:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].  \mforall{}[bs,as:n:\mBbbN{}  \mtimes{}  (\mBbbN{}n  {}\mrightarrow{}  T)].    (wqo-less(T;x,y.R[x;y];bs;as)  \mmember{}  \mBbbP{})


By

---

Latex:
ProveWfLemma

---

Home Index