Nuprl Lemma : third-derivative-log-contraction-bound
∀a:{a:ℝ| r0 < a} . ∀x:ℝ.
((((r(16) * a^2) * e^x^2) + ((r(-4) * a^3) * e^x) + ((r(-4) * a) * e^x^3)/a + e^x^4) ≤ (r1/r(2)))
Proof
Definitions occuring in Statement :
rexp: e^x,
rdiv: (x/y),
rleq: x ≤ y,
rless: x < y,
rnexp: x^k1,
rmul: a * b,
radd: a + b,
int-to-real: r(n),
real: ℝ,
all: ∀x:A. B[x],
set: {x:A| B[x]} ,
minus: -n,
natural_number: $n
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
rneq: x ≠ y,
guard: {T},
or: P ∨ Q,
prop: ℙ,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q),
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_stable: SqStable(P),
squash: ↓T,
nat_plus: ℕ+,
less_than: a < b,
less_than': less_than'(a;b),
true: True,
nat: ℕ,
le: A ≤ B,
false: False,
not: ¬A,
rge: x ≥ y,
rgt: x > y,
rdiv: (x/y),
req_int_terms: t1 ≡ t2,
top: Top,
subtract: n - m,
itermConstant: "const",
cand: A c∧ B
Lemmas referenced :
rnexp-positive,
radd_wf,
rexp_wf,
nat_plus_subtype_nat,
nat_plus_wf,
rmul_preserves_rleq,
rdiv_wf,
rmul_wf,
rnexp_wf,
rless-int,
real_wf,
set_wf,
rless_wf,
int-to-real_wf,
radd-zero,
sq_stable__rless,
less_than_wf,
false_wf,
le_wf,
rinv_wf2,
itermSubtract_wf,
itermMultiply_wf,
itermAdd_wf,
itermConstant_wf,
itermVar_wf,
req-iff-rsub-is-0,
radd_comm,
equal_wf,
rless_functionality_wrt_implies,
rleq_weakening_equal,
rleq_weakening_rless,
radd_functionality_wrt_rless1,
rexp-positive,
rless_functionality,
req_weakening,
rleq_functionality,
req_transitivity,
radd_functionality,
rmul_functionality,
rmul-rinv3,
rnexp_functionality,
rinv-mul-as-rdiv,
real_polynomial_null,
real_term_value_sub_lemma,
real_term_value_mul_lemma,
real_term_value_add_lemma,
real_term_value_const_lemma,
real_term_value_var_lemma,
rmul-assoc,
radd-preserves-rleq,
req_inversion,
req_functionality,
rnexp-add,
rnexp_step,
rnexp2,
real_term_polynomial,
rnexp2-nonneg,
rleq_wf,
rleq_functionality_wrt_implies,
radd_functionality_wrt_rleq,
arith-geom-mean-inequality-simple,
subtype_rel_sets,
rmul_preserves_rleq2,
rmul-is-positive,
squash_wf,
true_wf,
iff_weakening_equal,
rmul_preserves_rless,
rmul-zero-both,
rmul_comm,
rleq_weakening
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
because_Cache,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isectElimination,
setElimination,
rename,
hypothesisEquality,
hypothesis,
independent_functionElimination,
applyEquality,
sqequalRule,
independent_isectElimination,
inrFormation,
productElimination,
lambdaEquality,
natural_numberEquality,
imageMemberEquality,
baseClosed,
imageElimination,
dependent_set_memberEquality,
independent_pairFormation,
minusEquality,
equalityTransitivity,
equalitySymmetry,
approximateComputation,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
computeAll,
setEquality,
inlFormation,
universeEquality,
productEquality
Latex:
\mforall{}a:\{a:\mBbbR{}| r0 < a\} . \mforall{}x:\mBbbR{}.
((((r(16) * a\^{}2) * e\^{}x\^{}2) + ((r(-4) * a\^{}3) * e\^{}x) + ((r(-4) * a) * e\^{}x\^{}3)/a + e\^{}x\^{}4) \mleq{} (r1/r(2)))
Date html generated:
2017_10_04-PM-10_29_30
Last ObjectModification:
2017_07_28-AM-08_50_21
Theory : reals_2
Home
Index