---

Step * of Lemma least-upper-bound_wf

∀[T:Type]. ∀[R:T ⟶ T ⟶ ℙ]. ∀[a,b,c:T].  (least-upper-bound(T;x,y.R[x;y];a;b;c) ∈ ℙ)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[R:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].  \mforall{}[a,b,c:T].    (least-upper-bound(T;x,y.R[x;y];a;b;c)  \mmember{}  \mBbbP{})


By

---

Latex:
ProveWfLemma

---

Home Index