[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 changenonnxt-reachable-rev (
previous step
)
⊦ reachable(r, r0, H) ∧ ce.nxt = H[r1].nxt → (¬ reachable(r, r0, H[r1, ce]) ↔ false)
Lemma
changenonnxt-reachable