[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 lemma3
⊦ eqds(sys, sources(co + cl, d), sys0) → eqds(exec(sys, co) .1, sources(cl, d), exec(sys0, co) .1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma5
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 42
Used lemmas:
eqd-symmetry
,
eqd-transitivity
,
locally-respects
,
sources-rec
,
weakly-step-consistent
,
eqds-def
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
set-basic
/gen-secdomain-set/
Size-insert
set-basic
/gen-secdomain-set/
In-insert
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/
c