[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 union-addarray-rew
⊦ newref(r, st ∪ st0) → addarray(r, ty, vals, st ∪ st0) = st ∪ addarray(r, ty, vals, st0)
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: 21
Proof steps: 44
Used lemmas:
in-init-01
,
addarray-at-newref
,
add-in-other-index
,
in-1init-02
,
in-init-09
,
lookup-init
,
in-init-06
,
add-in-other
,
add-at-ok
,
in-add
,
length-1init-01
,
length-init
,
type-1init
,
add-in
,
add-at-other
,
lookup-1init
,
Used spec theorems:
store
/javastore/
Extension
storefunsx
/
union-at-right-01
storekey
/
ex-03
storefunsx
/
union-at-left
Used simplifier rules:
int-abs
/
forward-le-02
storekey
/
test-07
store
/javastore/
notmemlookup
storefunsx
/
lookup-xtra
storefunsx
/
union-at-right-02
storefuns
/
instore-01
storefuns
/
newref-03
storefunsx
/
union-at-right-01
int-abs
/
lels-03
int-abs
/
lels-04
storekey
/
test-08
storekey
/
elim-04
list-data
/javavalues/
l
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05
javavalue
/
inj-04
storefunsx
/
union-at-left
javavalue
/
inj-09
storekey
/
test-02
int-abs
/
lels-01
int-abs
/
lels
storekey
/
test
storekey
/
test-01
storefunsx
/
union-in
storefuns
/
newref-01
storefunsx
/
union-newref-02