[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-subarray-last
m + n < # ar, n ≠ 0 ⊦ rev(subarray(ar, m, n)).last = ar[m]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, 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: 11
Used lemmas:
subarray-inc
,
Used spec theorems:
array
/
Extension
list-last
/list-as-arrayinstance/
rev-rewrite
Used simplifier rules:
list-data
/list-as-arrayinstance/
l
nat-basic
/
f
list-last
/list-as-arrayinstance/
last-elim
list-last
/list-as-arrayinstance/
rev-e
list-last
/list-as-arrayinstance/
rev-empty
array-copy
/
size-subarray
list-data
/list-as-arrayinstance/
size-nil
list-last
/list-as-arrayinstance/
rev-in
list
/list-as-arrayinstance/
a
list
/list-as-arrayinstance/
in-15
list
/list-as-arrayinstance/
in-14
list-last
/list-as-arrayinstance/
rev-one
list-last
/list-as-arrayinstance/
rev-app
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/list-as-arrayinstance/
in-17
list
/list-as-arrayinstance/
in-append
list
/list-as-arrayinstance/
Last
nat-basic
/
l-02
nat-basic
/
l
nat
/
fle
nat
/
lels
nat-basic
/
oz
list
/list-as-arrayinstance/
e-02
array-copy
/
subarray-at
nat-basic
/
succ
list-last
/list-as-arrayinstance/
rev-length
list
/list-as-arrayinstance/
len-05
nat-basic
/
less-zero
nat-basic
/
add-base
list-del
/list-as-arrayinstance/
get-zero