[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 8 from proof reach-trans (conclusion)
⊦ reach(a, b, n) ∧ reach(b, c, m) → (¬ reach(a, c, m + n) ↔ false)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
reach(a, b, n), reach(b, c, m) ⊦ reach(a, c, m + n)
Rule argument
[emptyarg]
Additional information
[[CONCRETESIMPRULES : ()]]