[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 validrefkeynotnull-union
⊦ validrefkeynotnull(str, rk, ty, st) ∧ (∃ st0. st1 = st0 ∪ st) → validrefkeynotnull(str, rk, ty, st1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
validrefkeynotnull-union-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
junkref-union
,
junkref-keyin
,
validref-def
,
validrefnotnull-def
,
validrefnotnull-notnull
,
validrefvalnotnull-def
,
validrefkeynotnull-def
,
Used spec theorems:
storefunsx
/
union-at-right-01
Used simplifier rules:
storefuns
/
instore-01
store
/javastore/
notmemlookup
storefunsx
/
lookup-xtra
javavalue
/
sel-09
javavalue
/
test-19
javavalue
/
elim-13
storefunsx
/
union-at-right-01
storefunsx
/
union-in