[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 store-diff-union-elems-notin
⊦ ¬ n ∈ ns ∧ ¬ n ∈ nx → (gstore \ (ns ∪ elems nx))[n] = gstore[n]
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: 1
Proof steps: 3
Used lemmas:
elems-def
,
Used spec theorems:
store+set
/group-store-ablock-store-nat-store/
Diff-get
Used simplifier rules:
store+set
/group-store-ablock-store-nat-store/
Diff-mems-get
set-union
/nat-set/
unin
set-union
/nat-set/
una
set-union
/nat-set/
unc