[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 reachable-n-rec-strong2 (
previous step
)
⊦ reachable-n(H, n + 1, r, r0) ↔ reachable-1(H, r, H[r].nxt) ∧ reachable-n(H, n, H[r].nxt, r0)
Lemma
reachable-n-rec-strong