Nuprl Lemma : req*_wf
∀[x,y:ℝ*]. (x = y ∈ ℙ)
Proof
Definitions occuring in Statement :
req*: x = y,
real*: ℝ*,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
req*: x = y,
so_lambda: λ2x.t[x],
nat: ℕ,
real*: ℝ*,
subtype_rel: A ⊆r B,
so_apply: x[s]
Lemmas referenced :
exists_wf,
nat_wf,
all_wf,
int_upper_wf,
req_wf,
int_upper_subtype_nat,
real*_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
setElimination,
rename,
hypothesisEquality,
applyEquality,
because_Cache,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality
Latex:
\mforall{}[x,y:\mBbbR{}*]. (x = y \mmember{} \mBbbP{})
Date html generated:
2018_05_22-PM-03_14_08
Last ObjectModification:
2017_10_06-PM-01_54_25
Theory : reals_2
Home
Index