[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 unwind-BSD-theorem
⊦ lrf(view, trans, eqstate) ∧ osc(view, trans, eqstate) → BSP_BSD(view, trans)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
unwind-SD-theorem
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 22
Used lemmas:
lrf-def
,
lemma-5-4-2
,
Used spec theorems:
BSPs
/
BSP_BSD-def
eventfunsHO
/
in-trace-def
eventfunsHO
/
enabled-def
eventfunsHO
/
transex-append
eventfunsHO
/
transex-rec
Used simplifier rules:
list
/trace/
a
eventfunsHO
/
transex-enabled-intrans
eventfunsHO
/
enabled-transex
eventfunsHO
/
reachable-transex-01
eventfunsHO
/
reachable-trans
list
/trace/
c