[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 btree-leaf-adr
⊦ ((btree(rp, r, adr, 0, dirty, ri, iast, as, alladrs, nstat) * P))(zh) → alladrs = {adr}
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
btree-clean-alladrs
,
btree-clean-fwd
,
btree-clean-fwd-strong
,
btree-mark-dirty
,
btree-ri-unique
,
btree-write-node
,
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:
bleaf
,
btree
,
btree-adrs
,
btree-refed-subseteq-alladrs
,
Used spec theorems:
Used simplifier rules:
set-union
/node-store/
One
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat
/
ler
set-union
/node-store/
del-e-02
heap-sep
/zheap/
prop-shift
heap-sep
/zheap/
emp-sep
heap-sep
/zheap/
sep-ass
heap-sep
/zheap/
sep-com
heap-sep
/zheap/
and-ass
heap-sep
/zheap/
and-com
heap-sep
/zheap/
and
heap-sep
/zheap/
prop
set-basic
/node-store/
ne-01