[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-rkvs
⊦ rk ∈ st[rkvs] ↔ rk ∈ st ∨ rk ∈ rkvs
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
in-put-rkvs-01
,
in-put-rkvs-mode
,
init-put-rkvs-01
,
initdone-put-rkvs
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
put-rkvs-absorb
,
put-rkvs-switch
,
put-rkvs-one-01
,
put-rkvs-append
,
put-refkeyvalues-empty
,
Used spec theorems:
store
/javastore/
In-insert
Used simplifier rules:
assoclist
/refkeyvalues/
inone
pair
/refkeyvalues/
elim
assoclist
/refkeyvalues/
in-append
list
/refkeyvalues-assoclista/
a
list
/refkeyvalues-assoclista/
c
assoclist
/refkeyvalues/
empty