[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 enabled-def
⊦ enabled(trans, s, tr) ↔ (∃ s0. trans∃(trans, s, tr, s0))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
enabled-empty
,
enabled-transex
,
prefix-closed
,
transex-enabled-intrans
,
Used by units in proved state:
unwinding
,
MAKS-BSD
,
Proof exists?: No