[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-ginval-rem
⊦ dom gstore1 ⊆ dom gstore → nodes(gstore, ginval \ dom gstore1 \ dom gstore) = nodes(gstore, ginval)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 17
Used lemmas:
nodes-gstore-at
,
nodes-gstore-in
,
Used spec theorems:
store
/node-store/
k-Extension
ablock-store-inv
/group-store/
in
set-union
/nat-set/
Difference
Used simplifier rules:
address-data
/
elim
address-data
/
sel-05
address-data
/
sel-04
ablock
/group-store/
elim
store+set
/group-store-ablock-store-nat-store/
Dom
set-union
/nat-set/
Difference
groupnode
/
elim
address-data
/
sel-03
groupnode
/
sel
store
/node-store/
notmemlookup
ablock-store-inv
/group-store/
in-in-adr