[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 lookup-put-ex-first
(st[r0 -- sk, val][r -- sks]) ≠ st[r -- sks] ⊦ ∃ sks0, sks1. sks = sks0 + (sk + sks1) ∧ st[r -- sks0] .refval = r0 ∧ (∀ sks2. sks2 + sk ⊑ sks0 → st[r -- sks2] .refval ≠ r0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lookup-put-other
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 29
Used lemmas:
lookup-one
,
lookup-rec-01
,
lookup-empty
,
Used spec theorems:
store
/javastore/
At-other
list-last
/storekeys/
prefix-rec
Used simplifier rules:
list-last
/storekeys/
prefix-rec-03
list
/storekeys/
e-01
list-data
/storekeys/
elim-list-c
list
/storekeys/
first
list
/storekeys/
e-02
list-last
/storekeys/
prefix-one-01
list
/storekeys/
c-05
list
/storekeys/
e-03
list
/storekeys/
app-01
list
/storekeys/
Nil
list
/storekeys/
c-04
javavalue
/
sel-09
list-last
/storekeys/
prefix-empty
list
/storekeys/
app-02-ant
list
/storekeys/
e
store
/javastore/
At-same
refkey
/
inj
refkey
/
inj-01
javastore
/
look-ins
javastore
/
at-other-16
list
/storekeys/
a
list
/storekeys/
app
list
/storekeys/
Last
list
/storekeys/
c
javavalue
/
inj-03