[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-at-h
⊦ m < n ∧ n ≤ # ar → rev(ar, n)[m] = ar[# ar - m + 1]
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
rev-at
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 16
Used lemmas:
rev-size-h
,
rev-rec
,
rev-base
,
Used spec theorems:
array
/
Put-other
array
/
Put-same
Used simplifier rules:
nat-basic
/
f
nat
/
fle
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
/
lez
nat-basic
/
less-zero
nat
/
lep
nat
/
let
nat-basic
/
succ
nat-basic
/
eqs
nat
/
ler
nat-basic
/
eq-01
nat
/
fle-01
nat
/
lels-03
nat-basic
/
l-01
nat-basic
/
l-06
nat-basic
/
l
nat-basic
/
lf
nat
/
lels-02