[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 reachable-n-rec
⊦ reachable-n(H, n + 1, r, r0) ↔ (∃ r1. reachable-1(H, r, r1) ∧ reachable-n(H, n, r1, r0))
Type: An axiom
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
k-reachable-def
,
reach-n-path-n
,
reach-n-split
,
reach-n-unique
,
reachable-n-1
,
reachable-n-rec-rev
,
reachable-n-rec-rev2
,
reachable-n-rec-strong
,
reachable-n-rec-strong2
,
reachable-n-rec2
,
reachable-n-trans
,
Used by units in proved state:
Proof exists?: No