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