[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 lemma5-2
⊦ eqds(sys, sources(cl, d), sys0) ∧ eqS(sys, sys0) → eqd(run(sys, cl), d, run(sys0, ipurge(cl, d)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 83
Used lemmas:
locally-respects2
,
locally-respects
,
eqs-ipurged
,
eqd-reflexivity
,
eqd-transitivity
,
eqd-symmetry
,
sources-1
,
lemma3-2
,
ipurge-rec
,
run-rec
,
sources-rec
,
eqds-def
,
ipurge-base
,
run-base
,
sources-base
,
Used spec theorems:
AccessControlWithState
/
eqs-step
Used simplifier rules:
set-basic
/gen-secdomain-set/
In-insert
set-basic
/gen-secdomain-set/
eq
set-basic
/gen-secdomain-set/
rax
set-basic
/gen-secdomain-set/
size-zero
set-basic
/gen-secdomain-set/
ne
set-basic
/gen-secdomain-set/
size-zero-01
set-basic
/gen-secdomain-set/
ne-01
list
/gen-command-list/
a
list
/gen-command-list/
c
set-basic
/gen-secdomain-set/
in-04