Nuprl Lemma : realexp-radd
∀[x:{x:ℝ| r0 < x} ]. ∀[a,b:ℝ]. (realexp(x;a + b) = (realexp(x;a) * realexp(x;b)))
Proof
Definitions occuring in Statement :
realexp: realexp(x;y),
rless: x < y,
req: x = y,
rmul: a * b,
radd: a + b,
int-to-real: r(n),
real: ℝ,
uall: ∀[x:A]. B[x],
set: {x:A| B[x]} ,
natural_number: $n
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
realexp: realexp(x;y),
all: ∀x:A. B[x],
prop: ℙ,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
uiff: uiff(P;Q),
and: P ∧ Q,
rev_uimplies: rev_uimplies(P;Q),
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
req_functionality,
expr_wf,
rmul_wf,
radd_wf,
ln_wf,
rless_wf,
int-to-real_wf,
real_wf,
req_wf,
rlog_wf,
rexp_wf,
expr-req,
rmul_functionality,
req_witness,
realexp_wf,
set_wf,
req_weakening,
req_inversion,
rexp-radd,
rexp_functionality,
rmul-distrib2
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
dependent_functionElimination,
setElimination,
rename,
dependent_set_memberEquality,
natural_numberEquality,
applyEquality,
lambdaEquality,
setEquality,
sqequalRule,
because_Cache,
independent_isectElimination,
productElimination,
independent_functionElimination,
isect_memberEquality
Latex:
\mforall{}[x:\{x:\mBbbR{}| r0 < x\} ]. \mforall{}[a,b:\mBbbR{}]. (realexp(x;a + b) = (realexp(x;a) * realexp(x;b)))
Date html generated:
2017_10_04-PM-10_39_46
Last ObjectModification:
2017_06_06-AM-10_44_56
Theory : reals_2
Home
Index