[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 39 from proof acyclic-rem-not-reachable (
previous step
)
ce.nxt = H[ce.nxt].nxt, ce.nxt = H[r].nxt, r ∈ H, ce.nxt ∈ H, ∀ r1. ¬ reachable(H[r1].nxt, r1, H) ⊦ ce.nxt = null, r = ce.nxt, r = null
User applied rule all left
And closed the goal!
Rule argument
pos: left 5 terms: ce.nxt abort: F discard: T computed: F
Additional information
Used simplifier rules: self-reachable: ⊦ reachable(r, r, H) ↔ r ≠ null ∧ r ∈ H; Used terms: ce.nxt