[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-gstore0
⊦ n ∈ gstore ∧ ¬ n ∈ nx ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval → n ∈ gstore0
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: 3
Proof steps: 6
Used lemmas:
elems-def
,
Used spec theorems:
set-basic
/nat-set/
Extension
set-union
/nat-set/
unrax
Used simplifier rules:
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
set-union
/nat-set/
unc
set-union
/nat-set/
una
set-union
/nat-set/
unin-01
store+set
/group-store-ablock-store-nat-store/
Dom