Nuprl Lemma : rleq-range_sup
∀I:{I:Interval| icompact(I)} . ∀f:{x:ℝ| x ∈ I} ⟶ ℝ.
∀[c:{c:ℝ| c ∈ I} ]. (f[c] ≤ sup{f[x] | x ∈ I}) supposing ∀x,y:{x:ℝ| x ∈ I} . ((x = y) ⇒ (f[x] = f[y]))
Proof
Definitions occuring in Statement :
range_sup: sup{f[x] | x ∈ I},
icompact: icompact(I),
i-member: r ∈ I,
interval: Interval,
rleq: x ≤ y,
req: x = y,
real: ℝ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
implies: P ⇒ Q,
rleq: x ≤ y,
rnonneg: rnonneg(x),
le: A ≤ B,
and: P ∧ Q,
label: ...$L... t,
rfun: I ⟶ℝ,
sup: sup(A) = b,
rrange: f[x](x∈I),
upper-bound: A ≤ b,
rset-member: x ∈ A,
exists: ∃x:A. B[x],
cand: A c∧ B,
sq_stable: SqStable(P),
squash: ↓T
Latex:
\mforall{}I:\{I:Interval| icompact(I)\} . \mforall{}f:\{x:\mBbbR{}| x \mmember{} I\} {}\mrightarrow{} \mBbbR{}.
\mforall{}[c:\{c:\mBbbR{}| c \mmember{} I\} ]. (f[c] \mleq{} sup\{f[x] | x \mmember{} I\})
supposing \mforall{}x,y:\{x:\mBbbR{}| x \mmember{} I\} . ((x = y) {}\mRightarrow{} (f[x] = f[y]))
Date html generated:
2020_05_20-PM-00_16_25
Last ObjectModification:
2020_01_03-PM-01_28_37
Theory : reals
Home
Index