---

Step * of Lemma rel-confluent_wf

∀[T:Type]. ∀[R:T ⟶ T ⟶ ℙ].  (rel-confluent(T;x,y.R[x;y]) ∈ ℙ)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[R:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].    (rel-confluent(T;x,y.R[x;y])  \mmember{}  \mBbbP{})


By

---

Latex:
ProveWfLemma

---

Home Index