Nuprl Lemma : ln_functionality
∀[a:{a:ℝ| r0 < a} ]. ∀[b:ℝ]. ln(a) = ln(b) supposing a = b
Proof
Definitions occuring in Statement :
ln: ln(a),
rless: x < y,
req: x = y,
int-to-real: r(n),
real: ℝ,
uimplies: b supposing a,
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,
uimplies: b supposing a,
all: ∀x:A. B[x],
prop: ℙ,
subtype_rel: A ⊆r B,
guard: {T},
implies: P ⇒ Q,
uiff: uiff(P;Q),
and: P ∧ Q,
rev_uimplies: rev_uimplies(P;Q),
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
req_functionality,
ln_wf,
rless_wf,
int-to-real_wf,
real_wf,
req_wf,
rlog_wf,
rless_transitivity1,
rleq_weakening,
ln-req,
rlog_functionality,
req_weakening,
req_witness,
set_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
dependent_functionElimination,
setElimination,
rename,
dependent_set_memberEquality,
because_Cache,
hypothesis,
natural_numberEquality,
hypothesisEquality,
applyEquality,
lambdaEquality,
setEquality,
sqequalRule,
independent_functionElimination,
independent_isectElimination,
productElimination,
isect_memberEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[a:\{a:\mBbbR{}| r0 < a\} ]. \mforall{}[b:\mBbbR{}]. ln(a) = ln(b) supposing a = b
Date html generated:
2017_10_04-PM-10_35_37
Last ObjectModification:
2017_06_06-AM-10_55_44
Theory : reals_2
Home
Index