[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 keys-in
⊦ sk ∈ fis .keys ↔ sk ∈ fis
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
keys-in-01
,
keys-notin-02
,
keys-put
,
onlymod-is-update
,
validFields-put-01
,
validFields-putfis
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
getkeys-one
,
getkeys-app
,
getkeys-empty
,
Used spec theorems:
Used simplifier rules:
assoclist
/fieldinit/
inone
pair
/fieldinit/
sel-02
assoclist
/fieldinit/
in-append
list
/storekeys/
a
list
/storekeys/
in-17
list
/storekeys/
in-append
list
/fieldinit-assoclista/
a
list
/fieldinit-assoclista/
c
list
/storekeys/
in-empty
assoclist
/fieldinit/
empty