[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 unmodified-clean-eq-keys
n < nused, nused ≤ BRANCH_SIZE, # zbrar0 = # zbrar1, # zbrar0 = BRANCH_SIZE ⊦ unmodified(adr, mkznode(rp0, zbrar0, bv, false, nused), iast) ∧ unmodified(adr, mkznode(rp1, zbrar1, bv, false, nused), iast) → (zbrar1[n].key = zbrar0[n].key ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 15
Used lemmas:
unmodified
,
Used spec theorems:
znode-ops
/
save-node
array
/branch-array/
Extension
Used simplifier rules:
constants
/
branchsize-0
nat-basic
/
lf-01
nat
/
fle
nat-basic
/
f
znode
/
sel-04
znode-ops
/
save-properties
indexnode
/
inj-05
znode
/
sel-03
znode
/
sel-05
znode
/
sel-02
znode-ops
/
save-size
znode-ops
/
at-save-0
branch
/
inj
zbranch
/
sel-02
znode-ops
/
save-entry
branch
/
inj-01
zbranch
/
sel-04
znode-ops
/
save-branch
branch
/
disj-03