Nuprl Lemma : Riemann-sum_wf
∀[a:ℝ]. ∀[b:{b:ℝ| a ≤ b} ]. ∀[f:[a, b] ⟶ℝ]. ∀[k:ℕ+]. (Riemann-sum(f;a;b;k) ∈ ℝ)
Proof
Definitions occuring in Statement :
Riemann-sum: Riemann-sum(f;a;b;k),
rfun: I ⟶ℝ,
rccint: [l, u],
rleq: x ≤ y,
real: ℝ,
nat_plus: ℕ+,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]}
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
Riemann-sum: Riemann-sum(f;a;b;k),
let: let,
all: ∀x:A. B[x],
implies: P ⇒ Q,
iff: P ⇐⇒ Q,
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
partition-sum_wf,
rccint_wf,
rccint-icompact,
uniform-partition_wf,
default-partition-choice_wf,
full-partition_wf,
full-partition-non-dec,
nat_plus_wf,
rfun_wf,
set_wf,
real_wf,
rleq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
setElimination,
thin,
rename,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
isectElimination,
hypothesisEquality,
hypothesis,
independent_functionElimination,
productElimination,
because_Cache,
independent_isectElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
lambdaEquality
Latex:
\mforall{}[a:\mBbbR{}]. \mforall{}[b:\{b:\mBbbR{}| a \mleq{} b\} ]. \mforall{}[f:[a, b] {}\mrightarrow{}\mBbbR{}]. \mforall{}[k:\mBbbN{}\msupplus{}]. (Riemann-sum(f;a;b;k) \mmember{} \mBbbR{})
Date html generated:
2016_10_26-PM-00_01_27
Last ObjectModification:
2016_09_12-PM-05_37_41
Theory : reals_2
Home
Index