---

Step * 1 of Lemma totally-bounded-inf


1. [A] : Set(ℝ)
2. totally-bounded(A)
⊢ ∃b:ℝ. sup(-(A)) = -(b)
BY
{ Assert ⌜∃b:ℝ. sup(-(A)) = b⌝⋅ }

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

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

---

Latex:

---

Latex:

1.  [A]  :  Set(\mBbbR{})
2.  totally-bounded(A)
\mvdash{}  \mexists{}b:\mBbbR{}.  sup(-(A))  =  -(b)


By

---

Latex:
Assert  \mkleeneopen{}\mexists{}b:\mBbbR{}.  sup(-(A))  =  b\mkleeneclose{}\mcdot{}

---

Home Index