[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 switch-array
⊦ r ≠ r0 → addarray(r, ty, vals, addarray(r0, ty0, vals0, st)) = addarray(r0, ty0, vals0, addarray(r, ty, vals, st))
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: 11
Proof steps: 23
Used lemmas:
shift-1init
,
addarrayinit-base
,
addarrayinit-def
,
add-lastrec
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-c
list-last
/javavalues/
lb
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls-01
nat
/
lels
nat
/
le-num-02
nat
/
lep-01
nat-basic2
/
z
nat
/
add-01
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list-data
/javavalues/
l
nat
/
elim-pred-c
nat
/
pred-03
list-data
/javavalues/
size-01