[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 reachable-def
⊦ reachable(s) ↔ (∃ tr. trans∃(S0, tr, s))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
reachable-trans
,
reachable-transex
,
reachable-transex-01
,
Used by units in proved state:
Proof exists?: No