[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem orderedls-all
⊦ ordered<(x) ↔ (∀ m, n. m < n ∧ n < # x → x[m] < x[n])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 31
Used lemmas:
orderedls-ls
,
ls-o
,
ols-rec
,
ls-e
,
Used spec theorems:
list-del
/
get-rec
Used simplifier rules:
list-data
/
size-nil
nat-basic
/
less-zero
list
/
c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
list
/
e-01
list
/
c-07
nat-basic
/
zero
nat-basic
/
f
list
/
app
list
/
c-08
list-data
/
elim-list-c
nat
/
lels
nat
/
fle
oelem
/
nll
list-del
/
get-zero
nat
/
lez
nat-basic
/
lf-02
nat
/
elim-pred-c
nat
/
lep-02
nat-basic
/
oz
oelem
/
irreflexivity
list-data
/
l
list-del
/
get-succ
nat
/
succ-01
list-del
/
get-in
nat-basic
/
l
nat
/
l-num-06
nat
/
le-ls-simp
nat
/
ls-add-not-01
nat-basic
/
nls-fst
list-del
/
get-numrec