[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 prefix-subseteq-dom-nodes-rev
⊦ st0 ⊑ st1 → (dom nodes(st1) ⊆ dom nodes(st0) ↔ dom nodes(st1) = dom nodes(st0))
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: 11
Proof steps: 25
Used lemmas:
in-nodes
,
Used spec theorems:
ablock-store-inv
/
blockstore-prefix
set-union
/address-store/
subdef
set-basic
/address-store/
Extension
set-union
/nat-set/
subdef
ablock-store-inv
/
in
Used simplifier rules:
store+set
/address-store/
Dom
store+set
/ablock-store-nat-store/
Dom
ablock
/
elim
address-data
/
sel-05
address-data
/
sel-04
address-data
/
sel-03
ablock
/
sel-01
ablock
/
sel-02
list-last
/laddress-list/
prefix-notin