[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 reach-succ
⊦ reach(a, b, n + 1) ↔ (∃ c. reach(a, c, n) ∧ b ∈ succ(c))
Type: An axiom
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
path-equiv-reach
,
reach-one
,
reach-rec-rev
,
reach-trans
,
reachless-edge
,
reachless-succ-edge
,
Used by units in proved state:
INV
,
Proof exists?: No