[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-reset-root-frame
⊦ ((btree(rp, r, adr, height, false, ri, iast, as, alladrs, ok) * P))(zh) → ((btree(rp, null, adr, height, false, ri, iast, as, alladrs, ok) * true * P))(zh)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
btree-reset-root
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
maplet-null
,
btree
,
btree-adrs
,
btree-refed-subseteq-alladrs
,
btree-clean-alladrs
,
Used spec theorems:
Used simplifier rules:
set-basic
/node-store/
sub-idem
set-basic
/node-store/
size-zero-01
store+set
/index-store-address-store/
Dom
constants
/
branchsize-0
set-basic
/node-store/
ne-01
set-basic
/node-store/
sub-in
nat-basic
/
f
zbranch-array-ops
/
nsze-ok
heap-sep
/zheap/
true-elim
heap-sep
/zheap/
sep-ass
heap-sep
/zheap/
sep-com
heap-sep
/zheap/
true-emp