[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:
nat-basic1
/
less-1
list-data
/
size-01
list
/
app
nat
/
lez-01
list
/
c-08
list-data
/
elim-list-c
list
/
len-02
list
/
len
list
/
c
nat-basic1
/
z
nat-basic1
/
lf-02
nat
/
lez
oelem
/
irreflexivity
oelem
/
nll
nat-basic2
/
succ
list-del
/
get-in
nat
/
succ-01
list
/
app-02-ant
list
/
e
list
/
c-07
list
/
e-01
nat
/
l-num-06
nat
/
elim-pred-c
nat
/
lep-02
nat-basic2
/
oz
list-data
/
l
nat
/
fle
nat-basic1
/
f
nat
/
lels
nat-basic2
/
s
nat-basic2
/
l
nat
/
le-ls-simp
list-del
/
get-succ
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
list-del
/
get-zero-01
list
/
a
list-del
/
get-numrec