[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-istore-restrict
⊦ ((btree(rp, r0, adr, height, dirty0, ri, iast | as0, as, alladrs, nstat) * P))(zh0) → ((btree(rp, r0, adr, height, dirty0, ri, iast, as, alladrs, nstat) * P))(zh0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
btree-as-empty
,
btree-restrict-union-proper
,
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:
btree-istore-reduce
,
restrict-dom
,
btree-adrs
,
btree-refed-subseteq-alladrs
,
Used spec theorems:
Used simplifier rules:
heap-sep
/zheap/
sep-com
heap-sep
/zheap/
sep-ass
ablock-store-refsize-cons
/index-store/
restrict-subseteq