[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 lemma-5-4-2
osc ⊦ ∀ s1, s11. ∀ tr. proj(tr, Cview(view)) = [] ∧ reachable(s1) ∧ reachable(s11) → (enabled(s11, tr) ∧ eqstate(s11, s1) → (∃ tr0. proj(tr0, Cview(view)) = [] ∧ proj(tr0, Vview(view)) = proj(tr, Vview(view)) ∧ enabled(s1, tr0)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
BSD-unwind-theorem
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 21
Used lemmas:
osc-help
,
Used spec theorems:
eventfuns
/
transex-rec
eventfuns
/
enabled-def
eventfuns
/
transex-append
Used simplifier rules:
list
/trace/
Nil
eventfuns
/
enabled-transex
eventfuns
/
reachable-transex
eventfuns
/
reachable-trans
eventfuns
/
projection-one-empty
list
/trace/
app-02-ant
list
/trace/
a
eventfuns
/
projection-append
list
/trace/
c
eventfuns
/
enabled-empty
eventfuns
/
projection-empty