[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 fwd-in-gstore-loghead
⊦ nx ≠ [] ∧ ginval ∩ elems nx = ∅ ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval → nx.last ∈ gstore
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
elems-append
,
Used spec theorems:
list
/nat-list-set/
lastdiv-rew
set-basic
/nat-set/
Extension
Used simplifier rules:
list-last
/nat-list-set/
last-def
set-union
/nat-set/
int-c
set-union
/nat-set/
int-a
set-union
/nat-set/
int-ins
set-union
/nat-set/
unadd
list
/nat-list-set/
a
set-basic
/nat-set/
In-insert
set-union
/nat-set/
unin
store+set
/group-store-ablock-store-nat-store/
Dom
set-union
/nat-set/
una
set-union
/nat-set/
unc