[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 no-write-down-follows
∀ d. d ⇒ d ⊦ ¬ d ⇒ cdom(nam) → ¬ alter(nam, d)
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: 2
Proof steps: 6
Used lemmas:
observe-all-names
,
Used spec theorems:
AccessControl
/
alter-observe-respects-policy
Used simplifier rules: