[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 rev-get
⊦ n < # a → rev(a)[n] = a[# a - n + 1]
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: 3
Proof steps: 13
Used lemmas:
Used spec theorems:
list-del
/list-as-arrayinstance/
get-append-less
Used simplifier rules:
list-data
/list-as-arrayinstance/
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
/
lep
list
/list-as-arrayinstance/
a
nat-basic
/
succ
list
/list-as-arrayinstance/
len-05
list
/list-as-arrayinstance/
c
list
/list-as-arrayinstance/
Last
list-last
/list-as-arrayinstance/
rev-r
list
/list-as-arrayinstance/
e-01
nat-basic
/
eq-01
list-del
/list-as-arrayinstance/
get-append-grt
list-last
/list-as-arrayinstance/
rev-length
nat
/
le-add
nat-basic
/
add-base
nat
/
zero
list-del
/list-as-arrayinstance/
one-03
list-del
/list-as-arrayinstance/
get-zero
nat-basic
/
l-01
list
/list-as-arrayinstance/
len-02
nat-basic
/
one-01
nat
/
elim-pred-c
nat-basic
/
oz
list-data
/list-as-arrayinstance/
size-nil
nat-basic
/
z-01