[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 descending-order-is-max-permuted
⊦ ordered≤(rev(ar)) → max(ar)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
next-proper-permutation
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
not-ordered
,
lexicographic-rec1
,
lexicographic-base1
,
maximum-permutation
,
Used spec theorems:
list-perm
/natarray-oarray-sort/
rec
Used simplifier rules:
olist
/natarray-oarray-sort/
le-e
list-last
/natarray-oarray-sort/
rev-e
list-perm
/natarray-oarray-sort/
empty-01
olist
/natarray-oarray-sort/
app
list
/natarray-oarray-sort/
c
list
/natarray-oarray-sort/
a
list
/natarray-oarray-sort/
Last
list-last
/natarray-oarray-sort/
rev-r
list-perm
/natarray-oarray-sort/
empty
list
/natarray-oarray-sort/
app-02
list
/natarray-oarray-sort/
e
nat
/
lels-02
list-perm
/natarray-oarray-sort/
cons
nat-basic
/
f
oelem
/natarray/
sls
nat
/
gr-def
list-last
/natarray-oarray-sort/
rev-in
list
/natarray-oarray-sort/
in-17