[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 weakly-step-consistent2
⊦ eqd(sys, d, sys0) ∧ eqd(sys, cdom(co), sys0) ∧ eqS(sys, sys0) → eqd(step(sys, co), d, step(sys0, co))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma3-2
,
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:
eqd-reflexivity
,
eqd-transitivity
,
eqd-symmetry
,
Used spec theorems:
AccessControlWithState
/
RMA-2
AccessControlWithState
/
eqd-def
AccessControlWithState
/
RMA-3
Used simplifier rules: