[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 insert-inter-notin-dom-nodes
⊦ ¬ adr ∈ st → (as ++ adr) ∩ dom nodes(st) = as ∩ dom nodes(st)
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: 2
Proof steps: 4
Used lemmas:
in-nodes
,
Used spec theorems:
set-basic
/address-store/
Extension
set-union
/address-store/
Intersect
Used simplifier rules:
set-basic
/address-store/
In-insert
store+set
/address-store/
Dom
set-union
/address-store/
Intersect
set-union
/address-store/
int-a
set-union
/address-store/
int-c