[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 nopathex-update
⊦ ¬ junkref(str, r, st) ∧ ¬ _type ∈ fis ∧ ¬ path∃(str, r, r0, st) → ¬ path∃(str, r, r0, update(r0, fis, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
junkref-update
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 21
Used lemmas:
junkref-put-nopathex
,
pathex-put-last
,
Used spec theorems:
okfuns
/
update-ex-nodups
list-set
/fieldinit-assoclista/
subset
assoclist
/fieldinit/
ex
okfuns
/
update-rec
okfuns
/
update-put-notin
okfuns
/
keys-in
Used simplifier rules:
assoclist
/fieldinit/
inone
pair
/fieldinit/
elim
list-dup
/storekeys/
dups-cons
okfuns
/
getkeys-one
assoclist
/fieldinit/
in-append
list
/fieldinit-assoclista/
c
okfuns
/
update-empty
assoclist
/fieldinit/
empty
okfuns
/
getkeys-empty
list-dup
/storekeys/
e-01
assoclist
/fieldinit/
in-01
list-dup
/storekeys/
a
list
/fieldinit-assoclista/
in-06
list
/fieldinit-assoclista/
in-append
list
/storekeys/
a
list-dup
/storekeys/
f-01
list
/fieldinit-assoclista/
a
okfuns
/
getkeys-rec
okfuns
/
getkeys-app