[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-get
⊦ n→i(n) < j → (getarray(r, i, j, st)[n]) = st[r -- (i + n→i(n)) ']
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Comp-get
,
bar-at
,
getar-at
,
getarray-get
,
getintarray-at
,
getintarray-in
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
get-length
,
getArray-one
,
getArray-rec
,
Used spec theorems:
list-del
/javavalues/
get-last
list-del
/javavalues/
get-butlast
Used simplifier rules:
intnat
/
i2i-pos
intnat
/
n2n
intnat
/
nat2int-02
int-abs
/
anti
intnat
/
abs-succ-03
nat-basic2
/
s
intnat
/
labs
int-abs
/
abs-16
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c
intnat
/
abs-zero
nat-basic1
/
f
intnat
/
inni-ls
nat-basic1
/
neq-01
int-abs
/
leone
int-abs
/
succ-02
int-abs
/
sub-add
int-abs
/
elim-sub
list
/javavalues/
Last
list-del
/javavalues/
one-03
int-basic1
/
lf-02
int-abs
/
bet
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
ax-04
intnat
/
Nat2int-zero
intnat
/
nat2int-14
int-abs
/
forward-lsle
int-abs
/
lels