[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-load-key-leaf
⊦ iast[adr] = indexnode(brar, bv0, m) ∧ n < nused ∧ nused ≤ BRANCH_SIZE ∧ unmodified(adr, mkznode(rp, zbrar, bv1, false, nused), iast) → load(brar[n]).key = zbrar[n].key
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
unmodified
,
Used spec theorems:
znode-ops
/
save-node
Used simplifier rules:
constants
/
branchsize-0
nat
/
fle
nat-basic
/
f
znode-ops
/
save-properties
znode
/
sel-04
znode
/
sel-02
znode
/
sel-05
znode
/
sel-03
indexnode
/
inj-05
znode-ops
/
at-save-0
znode-ops
/
load-save-key