Nuprl Lemma : rleq*_wf
∀[x,y:ℝ*]. (x ≤ y ∈ ℙ)
Proof
Definitions occuring in Statement :
rleq*: x ≤ y,
real*: ℝ*,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
rleq*: x ≤ y
Lemmas referenced :
rrel*_wf,
rleq_wf,
real_wf,
real*_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
lambdaEquality,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[x,y:\mBbbR{}*]. (x \mleq{} y \mmember{} \mBbbP{})
Date html generated:
2018_05_22-PM-03_17_08
Last ObjectModification:
2017_10_06-PM-03_16_26
Theory : reals_2
Home
Index