[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 jnlhd-in-gstore
⊦ elems nx ⊆ dom gstore ∧ nx ≠ [] → (¬ nx.last ∈ gstore ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
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: 5
Used lemmas:
Used spec theorems:
set-union
/nat-set/
subdef
Used simplifier rules:
store+set
/group-store-ablock-store-nat-store/
Dom
apersistence-base
/
elems-def
list-last
/nat-list-set/
lin-01