[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-inv-alloc
⊦ ¬ n ∈ istore ∧ inv(istore) ∧ btree-inv(rp, adr, istore, istore0, zh0, ri, fi) → btree-inv(rp, adr, istore[n, indexblock(indx, lax, 0)], istore0, zh0, ri, fi)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 16
Used lemmas:
btree-crash
,
btree-istore-reduce-refed
,
btree-adrs
,
btree-refed-subseteq-alladrs
,
btree-clean-alladrs
,
btree-inv
,
Used spec theorems:
store
/index-store-address-store/
Subset
store+set
/index-store-address-store/
restrict-at
set-union
/node-store/
subdef
Used simplifier rules:
set-basic
/node-store/
sub-idem
ablock-store-refsize-cons
/group-store/
size-emp
ablock-store-refsize-cons
/index-store/
subseteq-dom-nodes-alloc-restrict-empty
ablock
/index-store/
sel-03
ablock-store-refsize-cons
/index-store/
refsize-cons-write
heap-sep
/zheap/
true-elim
set-basic
/node-store/
size-zero-01
ablock-nodes
/index-store/
nodes-at-alloc
store+set
/index-store-address-store/
restrict-in
ablock-nodes
/index-store/
at-nodes
set-basic
/node-store/
sub-ntrans
heap-sep
/zheap/
sep-com
heap-sep
/zheap/
sep-ass
store+set
/index-store-address-store/
Dom
ablock-nodes
/index-store/
in-nodes
set-basic
/node-store/
sub-in
set-basic
/node-store/
ne-01
ablock-store-inv
/index-store/
in-alloc