Nuprl Lemma : frs-increasing-sorted-by
∀[p:ℝ List]. (frs-increasing(p) 
⇐⇒ sorted-by(λx,y. (x < y);p))
Proof
Definitions occuring in Statement : 
frs-increasing: frs-increasing(p)
, 
rless: x < y
, 
real: ℝ
, 
sorted-by: sorted-by(R;L)
, 
list: T List
, 
uall: ∀[x:A]. B[x]
, 
iff: P 
⇐⇒ Q
, 
lambda: λx.A[x]
Definitions unfolded in proof : 
sorted-by: sorted-by(R;L)
, 
frs-increasing: frs-increasing(p)
, 
uall: ∀[x:A]. B[x]
, 
iff: P 
⇐⇒ Q
, 
and: P ∧ Q
, 
implies: P 
⇒ Q
, 
all: ∀x:A. B[x]
, 
member: t ∈ T
, 
int_seg: {i..j-}
, 
lelt: i ≤ j < k
, 
guard: {T}
, 
decidable: Dec(P)
, 
or: P ∨ Q
, 
less_than: a < b
, 
squash: ↓T
, 
uimplies: b supposing a
, 
satisfiable_int_formula: satisfiable_int_formula(fmla)
, 
exists: ∃x:A. B[x]
, 
false: False
, 
not: ¬A
, 
top: Top
, 
prop: ℙ
, 
le: A ≤ B
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
rev_implies: P 
⇐ Q
Lemmas referenced : 
list_wf, 
int_term_value_constant_lemma, 
int_formula_prop_le_lemma, 
itermConstant_wf, 
intformle_wf, 
decidable__le, 
select_wf, 
rless_wf, 
less_than_wf, 
all_wf, 
int_seg_wf, 
lelt_wf, 
int_formula_prop_wf, 
int_term_value_var_lemma, 
int_formula_prop_less_lemma, 
int_formula_prop_not_lemma, 
int_formula_prop_and_lemma, 
itermVar_wf, 
intformless_wf, 
intformnot_wf, 
intformand_wf, 
satisfiable-full-omega-tt, 
decidable__lt, 
real_wf, 
length_wf, 
int_seg_properties
Rules used in proof : 
sqequalSubstitution, 
sqequalRule, 
sqequalReflexivity, 
sqequalTransitivity, 
computationStep, 
isect_memberFormation, 
independent_pairFormation, 
lambdaFormation, 
cut, 
hypothesis, 
sqequalHypSubstitution, 
dependent_functionElimination, 
thin, 
setElimination, 
rename, 
dependent_set_memberEquality, 
hypothesisEquality, 
productElimination, 
lemma_by_obid, 
isectElimination, 
natural_numberEquality, 
unionElimination, 
imageElimination, 
independent_isectElimination, 
dependent_pairFormation, 
lambdaEquality, 
int_eqEquality, 
intEquality, 
isect_memberEquality, 
voidElimination, 
voidEquality, 
computeAll, 
independent_functionElimination, 
because_Cache, 
functionEquality
Latex:
\mforall{}[p:\mBbbR{}  List].  (frs-increasing(p)  \mLeftarrow{}{}\mRightarrow{}  sorted-by(\mlambda{}x,y.  (x  <  y);p))
Date html generated:
2016_05_18-AM-08_53_17
Last ObjectModification:
2016_01_17-AM-02_30_17
Theory : reals
Home
Index