[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-root-in-heap
⊦ r ≠ null ∧ ((btree(rp, r, adr, height, dirty, fi, iast, as, alladrs, nstat) * P))(zh) → r ∈ zh
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
btree-inv-clean-commit
,
btree-inv-remove-refsize0
,
btree-inv-root-neq-null-fwd
,
btree-inv-root-null-or-clean
,
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:
maplet-null
,
btree
,
btree-adrs
,
btree-refed-subseteq-alladrs
,
Used spec theorems:
Used simplifier rules:
set-basic
/node-store/
ne-01
heap-sep
/zheap/
sep-ass
heap-sep
/zheap/
sep-com
maplet
/zheap/
map-in
zbranch-array-ops
/
unmodified-dirty