[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 addarray-is-putarray
⊦ 0 ≤ i → addarray(r, val, i, st) = putArray(mklist(val, i→n(i)), r, 0, st)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
putByteArray-vals-addarray-01
,
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:
list-last
/javavalues/
mk-last-02
storearrays
/
putAr-lastrec
storearrays
/
putArray-put-switch
Used simplifier rules:
intnat
/
rax-04
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
int-abs
/
ler
int-abs
/
lels-01
int-abs
/
lels-04
oelem
/intlista/
irreflexivity
int-basic2
/
ax-04
intnat
/
i2i-pos-01
list-last
/javavalues/
mk-len
nat-basic2
/
pred
nat-basic2
/
oz
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
numleledel-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numle-02
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
list-last
/javavalues/
mk-zero
storearrays
/
putArray-empty
int-abs
/
forward-le-01