[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 gstore-dom-eq-hole
⊦ dom gstore0 = dom gstore1 ∧ gstore0 \ {n} = gstore1 \ {n} ∧ n ∈ gstore0 → (∃ gblock. gstore1 = gstore0[n, gblock])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 16
Used lemmas:
Used spec theorems:
store
/group-store-ablock-store-nat-store/
k-Extension
store
/group-store-ablock-store-nat-store/
In-insert
set-basic
/nat-set/
Extension
store
/group-store-ablock-store-nat-store/
Extension
store
/group-store-ablock-store-nat-store/
At-other
store+set
/group-store-ablock-store-nat-store/
Diff-get
Used simplifier rules:
set-union
/nat-set/
One
store+set
/group-store-ablock-store-nat-store/
Dom
store
/group-store-ablock-store-nat-store/
At-same
store+set
/group-store-ablock-store-nat-store/
Diff-ext
store
/group-store-ablock-store-nat-store/
notmemlookup
store+set
/group-store-ablock-store-nat-store/
Diff-get
store+set
/group-store-ablock-store-nat-store/
Diff-mems-get
set-basic
/nat-set/
in-04