[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 getarray-addarray-03
⊦ 0 ≤ i → getarray(r, 0, i, addarray(r, val, i, st)) = mklist(val, i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
getarray-addarray-02
,
getarray-addarray-05
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
1dim
,
addarray-rec
,
Used spec theorems:
storearrays
/
getArray-rec
storearrays
/
getArray-one
storearrays
/
getarray-put-05
Used simplifier rules:
intnat
/
abs-succ-03
nat-basic2
/
s
intnat
/
labs
int-abs
/
abs-16
int-abs
/
ler
int-basic1
/
ls-01
int-abs
/
lels-01
oelem
/intlista/
irreflexivity
list
/javavalues/
app-03
list
/javavalues/
Last
int-basic2
/
ax-04
int-abs
/
numsub
store
/javastore/
At-same
list
/javavalues/
c-04
list
/javavalues/
a
list
/javavalues/
Nil
int-abs
/
numleledel-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numle-02
nat-basic2
/
c
nat-basic2
/
a
list-last
/javavalues/
mklist-one
list-last
/javavalues/
mk-plus
intnat
/
rax
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
elim-sub
int-abs
/
forward-le-05
int-abs
/
ax-02
int-abs
/
lels
int-abs
/
anti
storearrays
/
get-zero
list-last
/javavalues/
mk-zero
int-abs
/
forward-le-01