[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 get-rev
⊦ n < # ar → rev(ar)[n] = ar[# ar - n + 1]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
next-proper-permutation
,
remains-ordered-by-swap
,
rev-subarray-split-last-swap
,
rev-subarray-split-step
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 14
Used lemmas:
Used spec theorems:
list
/natarray-oarray-sort/
lastdiv-rew
list-del
/natarray-oarray-sort/
get-append-less
Used simplifier rules:
list-data
/natarray-oarray-sort/
l
nat-basic
/
f
nat
/
succ-01
nat
/
lels
nat
/
ls-le-simp
nat-basic
/
a
nat-basic
/
c
nat
/
elim-sub
nat-basic
/
l-02
nat-basic
/
s-04
nat-basic
/
lf-01
nat-basic
/
zero
list
/natarray-oarray-sort/
len
list
/natarray-oarray-sort/
len-02
nat-basic
/
eq-01
list-last
/natarray-oarray-sort/
rev-app
list-last
/natarray-oarray-sort/
rev-one
list-del
/natarray-oarray-sort/
get-zero
list-del
/natarray-oarray-sort/
get-last
list
/natarray-oarray-sort/
a
nat
/
add-num-03
nat-basic
/
one
nat-basic
/
l
nat-basic
/
succ
list-del
/natarray-oarray-sort/
get-succ
nat
/
add-num-01
nat
/
fle
list-del
/natarray-oarray-sort/
get-append-grt
nat-basic
/
eq-02
nat-basic
/
z-01
nat-basic
/
oz