[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 at-put-same
⊦ sks ≠ [] ∧ ¬ dups(sks) → (st[r -- sks, val][r -- sks]) = val
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
at-put-keys-02
,
lookup-rec-01
,
put-rec-01
,
lookup-one
,
put-one
,
Used spec theorems:
Used simplifier rules:
list-last
/storekeys/
lin-02
store
/javastore/
At-same
list
/storekeys/
app
list-dup
/storekeys/
dups-cons
list
/storekeys/
a
list
/storekeys/
e-01
list
/storekeys/
c