[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 transex-rec
⊦ trans∃(trans, s, ev ' + tr, s0) ↔ (∃ s1. trans(s, ev, s1) ∧ trans∃(trans, s1, tr, s0))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
transex-append
,
transex-one
,
Used by units in proved state:
unwinding
,
MAKS-BSD
,
Proof exists?: No