[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 down-store-at-diff
¬ n ∈ ginval ⊦ (gstore \ ginval)↓[n] = gstore ↓[n]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
ginval-down
,
Used by units in proved state:
gjournal-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
down-store-in
,
down-store-at
,
Used spec theorems:
store
/group-store-ablock-store-nat-store/
notmemlookup
Used simplifier rules:
store+set
/group-store-ablock-store-nat-store/
Diff-get
store+set
/group-store-ablock-store-nat-store/
Diff-ext
store
/group-store-ablock-store-nat-store/
notmemlookup