[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-BSRA-theorem
⊦ xlrf ∧ xosc ∧ validx ∧ (∀ s. eqstate(s, s)) → BSP_BSRA
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 37
Used lemmas:
xlrf-intro
,
BSP_BSRA-def
,
xlrf-property
,
Used spec theorems:
MAKS-BSRA-unwinding
/
validx-def
eventfuns
/
in-trace-def
eventfuns
/
transex-append
eventfuns
/
reachable-trans
eventfuns
/
transex-enabled-intrans
eventfuns
/
enabled-def
eventfuns
/
transex-rec
Used simplifier rules:
eventfuns
/
reachable-trans
eventfuns
/
reachable-transex-01
list
/trace/
c