Nuprl Lemma : rmin-rmax-subinterval
∀I:Interval. ∀a,b:ℝ.  ((a ∈ I) 
⇒ (b ∈ I) 
⇒ [rmin(a;b), rmax(a;b)] ⊆ I )
Proof
Definitions occuring in Statement : 
subinterval: I ⊆ J 
, 
rccint: [l, u]
, 
i-member: r ∈ I
, 
interval: Interval
, 
rmin: rmin(x;y)
, 
rmax: rmax(x;y)
, 
real: ℝ
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
Definitions unfolded in proof : 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
member: t ∈ T
, 
uall: ∀[x:A]. B[x]
, 
iff: P 
⇐⇒ Q
, 
and: P ∧ Q
, 
rev_implies: P 
⇐ Q
, 
cand: A c∧ B
, 
prop: ℙ
Lemmas referenced : 
rcc-subinterval, 
rmin_wf, 
rmax_wf, 
rmin-i-member, 
rmax-i-member, 
rleq_wf, 
i-member_wf, 
real_wf, 
interval_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
lambdaFormation, 
cut, 
introduction, 
extract_by_obid, 
sqequalHypSubstitution, 
dependent_functionElimination, 
thin, 
hypothesisEquality, 
isectElimination, 
hypothesis, 
productElimination, 
independent_functionElimination, 
because_Cache, 
independent_pairFormation
Latex:
\mforall{}I:Interval.  \mforall{}a,b:\mBbbR{}.    ((a  \mmember{}  I)  {}\mRightarrow{}  (b  \mmember{}  I)  {}\mRightarrow{}  [rmin(a;b),  rmax(a;b)]  \msubseteq{}  I  )
Date html generated:
2016_10_26-AM-09_31_17
Last ObjectModification:
2016_09_09-AM-00_20_06
Theory : reals
Home
Index