[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 at-payload
m + nused ≤ # zbrar, n < nused, zbrar[m + n] = mkzentry(key, adr), ∀ n0. n0 < n ∧ zbrar[m + n0].entry? → zbrar[m + n0].key ≠ key ⊦ payload(zbrar, m, nused)[key] = adr
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
payload-shift-left
,
unmodified-payload
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 21
Used lemmas:
payload-rec
,
payload-base
,
Used spec theorems:
store
/node-index/
At-other
Used simplifier rules:
nat
/
lels
nat-basic
/
nls-fst
nat
/
lez
zbranch
/
sel-08
nat
/
succ-01
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
nat-basic
/
s-04
zbranch
/
elim-03
store
/node-index/
At-same
nat-basic
/
zero-01
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
zbranch
/
test-05
zbranch
/
sel-04