[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 nodes-dealloc
⊦ nodes(gstore -- n, ginval ++ n) = nodes(gstore, ginval) \ (dom nodes(gstore, ginval) | n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 21
Used lemmas:
nodes-gstore-at
,
nodes-gstore-in
,
Used spec theorems:
store
/node-store/
k-Extension
store+set
/node-store/
Diff-ext
ablock-store-refsize-cons
/group-store/
restrict-leb
store+set
/node-store/
Diff-get
ablock-store-inv
/group-store/
in
Used simplifier rules:
set-basic
/nat-set/
In-insert
address-data
/
elim
ablock
/group-store/
elim
store+set
/node-store/
Dom
ablock-store-refsize-cons
/group-store/
restrict-in
store+set
/node-store/
Diff-mems-get
ablock-store-refsize-cons
/group-store/
restrict-leb
store
/group-store-ablock-store-nat-store/
Del-in
address-data
/
sel-04
address-data
/
sel-05
store
/group-store-ablock-store-nat-store/
Del-at
ablock
/group-store/
sel-02
ablock-store-inv
/group-store/
at-dealloc
ablock-store-inv
/group-store/
in-dealloc
set-basic
/nat-set/
in-02
groupnode
/
elim
address-data
/
sel-03
groupnode
/
sel
store
/node-store/
notmemlookup
ablock-store-inv
/group-store/
in-in-adr