Step
*
of Lemma
interval-totally-bounded
No Annotations
∀a:ℝ. ∀b:{b:ℝ| a ≤ b} . totally-bounded(λx.(x ∈ [a, b]))
BY
{ (Auto THEN (D 0 THEN Auto) THEN Assert ⌜∃k:ℕ+. ((b - a/r(k)) < e)⌝⋅) }
1
.....assertion.....
1. a : ℝ
2. b : {b:ℝ| a ≤ b}
3. e : ℝ
4. r0 < e
⊢ ∃k:ℕ+. ((b - a/r(k)) < e)
2
1. a : ℝ
2. b : {b:ℝ| a ≤ b}
3. e : ℝ
4. r0 < e
5. ∃k:ℕ+. ((b - a/r(k)) < e)
⊢ ∃n:ℕ+
∃a@0:ℕn ⟶ ℝ. ((∀i:ℕn. (a@0 i ∈ λx.(x ∈ [a, b]))) ∧ (∀x:ℝ. ((x ∈ λx.(x ∈ [a, b]))
⇒ (∃i:ℕn. (|x - a@0 i| < e)))))
Latex:
Latex:
No Annotations
\mforall{}a:\mBbbR{}. \mforall{}b:\{b:\mBbbR{}| a \mleq{} b\} . totally-bounded(\mlambda{}x.(x \mmember{} [a, b]))
By
Latex:
(Auto THEN (D 0 THEN Auto) THEN Assert \mkleeneopen{}\mexists{}k:\mBbbN{}\msupplus{}. ((b - a/r(k)) < e)\mkleeneclose{}\mcdot{})
Home
Index