[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 at=get
⊦ 0 ≤ i ∧ i < j → st[r -- i '] = (getarray(r, 0, j, st)[i→n(i)])
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: 5
Proof steps: 10
Used lemmas:
get-length
,
getArray-one
,
getArray-rec
,
Used spec theorems:
list-del
/javavalues/
get-butlast
list-del
/javavalues/
get-last
Used simplifier rules:
int-basic1
/
ls-01
int-abs
/
lels-04
int-abs
/
lels-01
intnat
/
abs-succ-03
nat-basic2
/
s
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c
intnat
/
abs-eq
int-abs
/
ler
int-abs
/
zero-gels-04
int-abs
/
anti
int-abs
/
abs-16
int-abs
/
absle
intnat
/
labs
int-abs
/
forward-lele
int-basic2
/
zero-02
int-abs
/
numls-02
int-abs
/
succ-02
int-abs
/
elim-sub
int-basic1
/
forward-pos
list
/javavalues/
Last
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
ax-04
int-abs
/
lels
int-abs
/
forward-lsle
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-abs
/
bet-01
int-abs
/
bet
oelem
/intlista/
lel
list-del
/javavalues/
one-03