Nuprl Lemma : expr-req
∀[x:ℝ]. (expr(x) = e^x)
Proof
Definitions occuring in Statement :
expr: expr(x),
rexp: e^x,
req: x = y,
real: ℝ,
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
sq_stable: SqStable(P),
squash: ↓T,
subtype_rel: A ⊆r B
Lemmas referenced :
expr_wf,
set_wf,
real_wf,
req_wf,
rexp_wf,
sq_stable__req,
equal_wf,
req_witness
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
sqequalRule,
lambdaEquality,
lambdaFormation,
setElimination,
rename,
independent_functionElimination,
imageMemberEquality,
baseClosed,
imageElimination,
equalityTransitivity,
equalitySymmetry,
dependent_functionElimination,
applyEquality,
setEquality
Latex:
\mforall{}[x:\mBbbR{}]. (expr(x) = e\^{}x)
Date html generated:
2017_10_04-PM-10_37_59
Last ObjectModification:
2017_06_06-AM-10_43_36
Theory : reals_2
Home
Index