[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 in-put
⊦ 1 < # sks → (rk ∈ st[r -- sks, val] ↔ rk ∈ st ∨ rk = st[r -- sks .butlast] .refval -- sks .last)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
in-mode-put
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 19
Used lemmas:
lookup-rec-01
,
put-rec-01
,
put-two
,
lookup-one
,
Used spec theorems:
list-data
/storekeys/
lf-01
Used simplifier rules:
list
/storekeys/
e-02
list-last
/storekeys/
last-elim
store
/javastore/
In-insert
refkey
/
inj
list-last
/storekeys/
b
list
/storekeys/
c-03
list-data
/storekeys/
elim-list-c
list-last
/storekeys/
l-06
list
/storekeys/
app
list-last
/storekeys/
l-02
list-last
/storekeys/
bapp
list
/storekeys/
e-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
one
list
/storekeys/
a
list
/storekeys/
len-02
list
/storekeys/
len
list
/storekeys/
c
refkey
/
inj-01
list-data
/storekeys/
l
nat-basic1
/
one