---

Step * of Lemma non-forking_wf

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

---

Latex:

---

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


By

---

Latex:
ProveWfLemma\mcdot{}

---

Home Index