[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 2 from proof reachable-n-rec-rev2 (
previous step
)
⊦ reachable-n(H, n + 1, r, r0) ↔ (∃ r1. reachable-n(H, n, r, r1) ∧ reachable-1(H, r1, r0))
Lemma
reachable-n-rec-rev