[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-at-other
⊦ r ≠ r0 ∨ r = r0 ∧ is_fskey(sk) ∧ sk ≠ _length ∧ sk ≠ _type ∨ r = r0 ∧ is_indexkey(sk) ∧ (sk .index < 0 ∨ n→i(# vals) ≤ sk .index) → (addarray(r, ty, vals, st)[r0 -- sk]) = st[r0 -- sk]
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
addarray-addaray
,
addarray-identity
,
putarray-add-same
,
putarray-addarray-override
,
union-addarray-rew
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
add-at-ok
,
add-at-other-index
,
add-at-04
,
lookup-1init
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
lels-03
storekey
/
test-08
storekey
/
elim-04
storekey
/
test-01