[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 < # x → rev(x)[n] = x[# x - n + 1]
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
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:
one-03
,
get-butlast
,
get-append-grt
,
get-zero
,
get-append-less
,
Used spec theorems:
Used simplifier rules:
list-last
/
rev-e
list-data
/
size-nil
nat-basic
/
less-zero
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
nat-basic
/
succ
list
/
len-05
list
/
c
nat
/
cancel-01
list
/
Last
list-last
/
rev-r
nat
/
elim-sub
nat
/
lep
nat-basic
/
add-base
nat
/
le-add
list-last
/
rev-length
nat
/
zero
nat-basic
/
refl-nat
nat-basic
/
l-01
nat-basic
/
f
nat-basic
/
lf-01
list
/
len-02
nat-basic
/
one-01
nat
/
elim-pred-c
nat-basic
/
oz
nat
/
eq-01
nat-basic
/
l-02