[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 add-put-switch
⊦ is_fskey(sk) ∨ r ≠ r0 → addarray(r, val, i, st[r0 -- sk, val0]) = (addarray(r, val, i, st)[r0 -- sk, val0])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
at-1dim-other-index
,
getarray-addarray-02
,
getarray-addarray-04
,
putByteArray-vals-addarray
,
putByteArray-vals-addarray-01
,
switch-addarray-addclass
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
1dim-01
,
addarray-base
,
addarray-rec
,
shift-1dim-01
,
Used spec theorems:
store
/javastore/
rew
Used simplifier rules:
intnat
/
rax-04
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c
refkey
/
inj-01
refkey
/
inj
store
/javastore/
insins
storekey
/
test-06
int-abs
/
forward-le-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
elim-sub
int-abs
/
forward-le-05
int-abs
/
ax-02
int-abs
/
lels