[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 3 from proof INVR-step (
previous step
)
⊦ reach(a, b, n + 1) → (∃ c. c ∈ succ(a) ∧ reach(c, b, n))
A spec-lemma