Nuprl Lemma : rfun*2_wf
∀[f:ℝ ⟶ ℝ ⟶ ℝ]. ∀[x,y:ℝ*]. (f*(x;y) ∈ ℝ*)
Proof
Definitions occuring in Statement :
rfun*2: f*(x;y),
real*: ℝ*,
real: ℝ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
rfun*2: f*(x;y),
real*: ℝ*,
subtype_rel: A ⊆r B
Lemmas referenced :
real_wf,
nat_wf,
real*_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lambdaEquality,
applyEquality,
functionExtensionality,
hypothesisEquality,
extract_by_obid,
hypothesis,
sqequalHypSubstitution,
thin,
functionEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
isectElimination,
because_Cache
Latex:
\mforall{}[f:\mBbbR{} {}\mrightarrow{} \mBbbR{} {}\mrightarrow{} \mBbbR{}]. \mforall{}[x,y:\mBbbR{}*]. (f*(x;y) \mmember{} \mBbbR{}*)
Date html generated:
2018_05_22-PM-03_15_37
Last ObjectModification:
2017_10_06-PM-02_28_44
Theory : reals_2
Home
Index