Nuprl Lemma : third-derivative-log-contraction
∀a:{a:ℝ| r0 < a}
d((((r(-4) * a) * e^x) * (a - e^x)/a + e^x^3))/dx = λx.(((r(16) * a^2) * e^x^2)
+ ((r(-4) * a^3) * e^x)
+ ((r(-4) * a) * e^x^3)/a + e^x^4) on (-∞, ∞)
Proof
Definitions occuring in Statement :
derivative: d(f[x])/dx = λz.g[z] on I,
riiint: (-∞, ∞),
rexp: e^x,
rdiv: (x/y),
rless: x < y,
rnexp: x^k1,
rsub: x - y,
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],
sq_stable: SqStable(P),
implies: P ⇒ Q,
squash: ↓T,
nonzero-on: f[x]≠r0 for x ∈ I,
sq_exists: ∃x:{A| B[x]},
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
cand: A c∧ B,
nat_plus: ℕ+,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
or: P ∨ Q,
guard: {T},
uimplies: b supposing a,
rfun: I ⟶ℝ,
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q),
top: Top,
true: True,
rless: x < y,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
subtract: n - m,
sq_type: SQType(T),
less_than: a < b,
rneq: x ≠ y,
rge: x ≥ y,
rgt: x > y,
itermConstant: "const",
req_int_terms: t1 ≡ t2,
rfun-eq: rfun-eq(I;f;g),
r-ap: f(x),
rsub: x - y,
rdiv: (x/y)
Lemmas referenced :
sq_stable__rless,
int-to-real_wf,
rnexp_wf,
false_wf,
le_wf,
rnexp-positive,
i-member_wf,
i-approx_wf,
less_than_wf,
riiint_wf,
real_wf,
rless_wf,
all_wf,
rleq_wf,
rabs_wf,
radd_wf,
rexp_wf,
set_wf,
nat_plus_wf,
icompact_wf,
nat_plus_subtype_nat,
rmul-is-positive,
rnexp-nonneg,
rleq_weakening_rless,
rnexp-rleq,
rleq_weakening_equal,
rmul_wf,
rsub_wf,
req_functionality,
radd_functionality,
rmul_functionality,
rsub_functionality,
req_weakening,
rexp_functionality,
req_wf,
rnexp_functionality,
true_wf,
member_riiint_lemma,
top_wf,
subtype_rel_dep_function,
subtype_base_sq,
int_subtype_base,
nat_plus_properties,
decidable__equal_int,
satisfiable-full-omega-tt,
intformnot_wf,
intformeq_wf,
itermConstant_wf,
itermSubtract_wf,
int_formula_prop_not_lemma,
int_formula_prop_eq_lemma,
int_term_value_constant_lemma,
int_term_value_subtract_lemma,
int_formula_prop_wf,
iproper-riiint,
rdiv_wf,
rleq_functionality,
rabs-of-nonneg,
rleq_functionality_wrt_implies,
radd_functionality_wrt_rless1,
rexp-positive,
real_term_polynomial,
itermAdd_wf,
itermVar_wf,
real_term_value_const_lemma,
real_term_value_sub_lemma,
real_term_value_add_lemma,
real_term_value_var_lemma,
req-iff-rsub-is-0,
rless_functionality_wrt_implies,
rless_functionality,
derivative-rdiv,
derivative-mul,
derivative-const-mul,
derivative-rexp,
derivative-sub,
derivative-const,
derivative-rnexp-function,
derivative-add,
derivative_functionality,
rnexp-add,
rdiv_functionality,
rnexp_step,
equal_wf,
rminus-as-rmul,
radd-zero-both,
rminus_functionality,
rminus_wf,
rminus-rminus,
rminus-radd,
radd-int,
rmul-distrib2,
radd-rminus-assoc,
radd_comm,
radd-ac,
radd-assoc,
rmul_comm,
rmul-ac,
rmul-assoc,
rmul_over_rminus,
rmul-distrib,
req_inversion,
req_transitivity,
uiff_transitivity,
rmul-int,
rnexp2,
rmul_preserves_req,
req-implies-req,
itermMultiply_wf,
real_term_value_mul_lemma,
and_wf,
rinv_wf2,
rinv-of-rmul,
rmul-rinv,
rmul-rinv3,
squash_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
setElimination,
thin,
rename,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
isectElimination,
natural_numberEquality,
hypothesis,
hypothesisEquality,
independent_functionElimination,
sqequalRule,
imageMemberEquality,
baseClosed,
imageElimination,
dependent_set_memberFormation,
dependent_set_memberEquality,
independent_pairFormation,
because_Cache,
productEquality,
lambdaEquality,
functionEquality,
applyEquality,
productElimination,
inlFormation,
independent_isectElimination,
minusEquality,
setEquality,
isect_memberEquality,
voidElimination,
voidEquality,
instantiate,
cumulativity,
intEquality,
unionElimination,
dependent_pairFormation,
computeAll,
equalityTransitivity,
equalitySymmetry,
inrFormation,
int_eqEquality,
addEquality,
multiplyEquality,
hyp_replacement,
applyLambdaEquality
Latex:
\mforall{}a:\{a:\mBbbR{}| r0 < a\}
d((((r(-4) * a) * e\^{}x) * (a - e\^{}x)/a + e\^{}x\^{}3))/dx = \mlambda{}x.(((r(16) * a\^{}2) * e\^{}x\^{}2)
+ ((r(-4) * a\^{}3) * e\^{}x)
+ ((r(-4) * a) * e\^{}x\^{}3)/a + e\^{}x\^{}4) on (-\minfty{}, \minfty{})
Date html generated:
2017_10_04-PM-10_29_09
Last ObjectModification:
2017_07_28-AM-08_50_18
Theory : reals_2
Home
Index