[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 6 from proof path-modify (
previous step
)
r ∈ H, ∀ H0, r2, ce0. (path(H[r].nxt ' + x, H0[r2, ce0]) ↔ path(H[r].nxt ' + x, H0)) ∨ r2 = H[r].nxt ∨ r2 ∈ x ⊦ r0 = H[r].nxt, r = null, path(H[r].nxt ' + x, H[r0, ce]) ↔ path(H[r].nxt ' + x, H), r0 = r, r0 ∈ x
User applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: H, r0, ce abort: F discard: T computed: T
Additional information
Used terms: H, r0, ce