Nuprl Lemma : convex-negative-nonzero-on
∀I:Interval. ∀f:I ⟶ℝ.
((∀x,y:ℝ. ((x ∈ I) ⇒ (y ∈ I) ⇒ (x = y) ⇒ (f[x] = f[y])))
⇒ (∀x:ℝ. ((x ∈ I) ⇒ (f[x] < r0)))
⇒ convex-on(I;x.f[x])
⇒ f[x]≠r0 for x ∈ I)
Proof
Definitions occuring in Statement :
convex-on: convex-on(I;x.f[x]),
nonzero-on: f[x]≠r0 for x ∈ I,
rfun: I ⟶ℝ,
i-member: r ∈ I,
interval: Interval,
rless: x < y,
req: x = y,
int-to-real: r(n),
real: ℝ,
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
natural_number: $n
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
nonzero-on: f[x]≠r0 for x ∈ I,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
label: ...$L... t,
rfun: I ⟶ℝ,
nat_plus: ℕ+,
uimplies: b supposing a,
sq_stable: SqStable(P),
and: P ∧ Q,
squash: ↓T,
sq_exists: ∃x:A [B[x]],
cand: A c∧ B,
guard: {T},
subinterval: I ⊆ J ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
less_than: a < b,
less_than': less_than'(a;b),
true: True,
uiff: uiff(P;Q),
req_int_terms: t1 ≡ t2,
false: False,
not: ¬A,
top: Top,
rev_uimplies: rev_uimplies(P;Q),
stable: Stable{P},
or: P ∨ Q,
exists: ∃x:A. B[x],
convex-on: convex-on(I;x.f[x]),
i-member: r ∈ I,
rccint: [l, u],
rge: x ≥ y,
rbetween: x≤y≤z
Lemmas referenced :
set_wf,
nat_plus_wf,
icompact_wf,
i-approx_wf,
convex-on_wf,
i-member_wf,
real_wf,
all_wf,
rless_wf,
int-to-real_wf,
req_wf,
rfun_wf,
interval_wf,
i-approx-is-subinterval,
less_than_wf,
sq_stable__i-member,
left-endpoint_wf,
i-approx-finite,
icompact-endpoints,
right-endpoint_wf,
rmin_wf,
rminus_wf,
rleq_wf,
rabs_wf,
rmin_strict_ub,
rmul_reverses_rless_iff,
rless-int,
rless_functionality,
rmul_wf,
rmul-zero-both,
itermSubtract_wf,
itermMultiply_wf,
itermMinus_wf,
itermVar_wf,
itermConstant_wf,
req-iff-rsub-is-0,
real_polynomial_null,
real_term_value_sub_lemma,
real_term_value_mul_lemma,
real_term_value_minus_lemma,
real_term_value_var_lemma,
real_term_value_const_lemma,
rleq_weakening_rless,
rmul_reverses_rleq_iff,
rleq_functionality,
rmax_wf,
rminus-rminus,
req_weakening,
rabs-of-nonpos,
rminus-rmin,
rmax_functionality,
stable__rleq,
false_wf,
or_wf,
not_wf,
minimal-double-negation-hyp-elim,
minimal-not-not-excluded-middle,
i-member-compact,
sq_stable__icompact,
rbetween-convex,
i-member-convex,
radd_wf,
rsub_wf,
rleq_functionality_wrt_implies,
rleq_weakening_equal,
rmax-ub-convex,
equal_wf,
not-rless,
rleq_antisymmetry,
icompact-endpoints-rleq,
rleq_transitivity,
rleq-rmax
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
sqequalRule,
lambdaEquality,
hypothesisEquality,
applyEquality,
setElimination,
rename,
dependent_set_memberEquality,
setEquality,
functionEquality,
natural_numberEquality,
because_Cache,
dependent_functionElimination,
independent_isectElimination,
independent_functionElimination,
productElimination,
imageMemberEquality,
baseClosed,
imageElimination,
dependent_set_memberFormation,
independent_pairFormation,
productEquality,
minusEquality,
approximateComputation,
int_eqEquality,
equalityTransitivity,
equalitySymmetry,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
unionElimination
Latex:
\mforall{}I:Interval. \mforall{}f:I {}\mrightarrow{}\mBbbR{}.
((\mforall{}x,y:\mBbbR{}. ((x \mmember{} I) {}\mRightarrow{} (y \mmember{} I) {}\mRightarrow{} (x = y) {}\mRightarrow{} (f[x] = f[y])))
{}\mRightarrow{} (\mforall{}x:\mBbbR{}. ((x \mmember{} I) {}\mRightarrow{} (f[x] < r0)))
{}\mRightarrow{} convex-on(I;x.f[x])
{}\mRightarrow{} f[x]\mneq{}r0 for x \mmember{} I)
Date html generated:
2018_05_22-PM-02_20_46
Last ObjectModification:
2017_10_20-PM-05_29_11
Theory : reals
Home
Index