[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 update-ex-nodups
⊦ ∃ fis0. ¬ dups(fis0 .keys) ∧ update(r, fis, st) = update(r, fis0, st) ∧ fis0 ⊆ fis
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
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:
update-putfis-sw
,
dups-fis-keys
,
update-rec-01
,
getkeys-empty
,
update-empty
,
Used spec theorems:
list-set
/fieldinit-assoclista/
subset
Used simplifier rules:
list
/fieldinit-assoclista/
in-06
list-set
/fieldinit-assoclista/
sub-notin
assoclist
/fieldinit/
put-in
pair
/fieldinit/
elim
list
/fieldinit-assoclista/
a
list
/fieldinit-assoclista/
c
list-set
/fieldinit-assoclista/
subset-empty-01
list-dup
/storekeys/
e-01