Step
*
1
of Lemma
range_sup-bound
1. I : {I:Interval| icompact(I)}
2. f : {x:ℝ| x ∈ I} ⟶ ℝ
3. ∀x,y:{x:ℝ| x ∈ I} . ((x = y)
⇒ (f[x] = f[y]))
4. s : ℝ
5. sup{f[x] | x ∈ I} = s ∈ ℝ
6. sup(f[x](x∈I)) = s
7. c : ℝ
8. ∀x:ℝ. ((x ∈ I)
⇒ (f[x] ≤ c))
⊢ s ≤ c
BY
{ (BLemma `rleq-iff-all-rless` THEN Auto) }
1
1. I : {I:Interval| icompact(I)}
2. f : {x:ℝ| x ∈ I} ⟶ ℝ
3. ∀x,y:{x:ℝ| x ∈ I} . ((x = y)
⇒ (f[x] = f[y]))
4. s : ℝ
5. sup{f[x] | x ∈ I} = s ∈ ℝ
6. sup(f[x](x∈I)) = s
7. c : ℝ
8. ∀x:ℝ. ((x ∈ I)
⇒ (f[x] ≤ c))
9. e : {e:ℝ| r0 < e}
⊢ s ≤ (c + e)
Latex:
Latex:
1. I : \{I:Interval| icompact(I)\}
2. f : \{x:\mBbbR{}| x \mmember{} I\} {}\mrightarrow{} \mBbbR{}
3. \mforall{}x,y:\{x:\mBbbR{}| x \mmember{} I\} . ((x = y) {}\mRightarrow{} (f[x] = f[y]))
4. s : \mBbbR{}
5. sup\{f[x] | x \mmember{} I\} = s
6. sup(f[x](x\mmember{}I)) = s
7. c : \mBbbR{}
8. \mforall{}x:\mBbbR{}. ((x \mmember{} I) {}\mRightarrow{} (f[x] \mleq{} c))
\mvdash{} s \mleq{} c
By
Latex:
(BLemma `rleq-iff-all-rless` THEN Auto)
Home
Index