Nuprl Lemma : rexp-rless
∀x,y:ℝ. (x < y ⇐⇒ e^x < e^y)
Proof
Definitions occuring in Statement :
rexp: e^x,
rless: x < y,
real: ℝ,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
rev_implies: P ⇐ Q,
uimplies: b supposing a
Lemmas referenced :
rexp_functionality_wrt_rless,
rless_wf,
rlog_functionality_wrt_rless,
rexp-positive,
rexp_wf,
int-to-real_wf,
real_wf,
rlog_wf,
rless_functionality,
rlog-rexp
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
independent_pairFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
independent_functionElimination,
hypothesis,
isectElimination,
dependent_set_memberEquality,
natural_numberEquality,
because_Cache,
independent_isectElimination,
productElimination
Latex:
\mforall{}x,y:\mBbbR{}. (x < y \mLeftarrow{}{}\mRightarrow{} e\^{}x < e\^{}y)
Date html generated:
2016_10_26-PM-00_39_09
Last ObjectModification:
2016_10_14-PM-02_49_47
Theory : reals_2
Home
Index