[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
,
Proof step 4 from proof reachable-transex-01 (conclusion)
⊦ ¬ reachable(trans, s) → ¬ trans∃(trans, S0, tr, s)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
trans∃(trans, S0, tr, s) ⊦ reachable(trans, s)
Rule argument
[emptyarg]
Additional information
[[CONCRETESIMPRULES : ()]]