---

Step * of Lemma totally-bounded-inf

∀[A:Set(ℝ)]. (totally-bounded(A) ⇒ (∃b:ℝ. inf(A) = b))
BY
{ (Auto THEN RWO "inf-as-sup" 0 THEN Auto) }

1
1. [A] : Set(ℝ)
2. totally-bounded(A)
⊢ ∃b:ℝ. sup(-(A)) = -(b)

---

Latex:

---

Latex:
\mforall{}[A:Set(\mBbbR{})].  (totally-bounded(A)  {}\mRightarrow{}  (\mexists{}b:\mBbbR{}.  inf(A)  =  b))


By

---

Latex:
(Auto  THEN  RWO  "inf-as-sup"  0  THEN  Auto)

---

Home Index