[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 5 from proof path-unfold-wand (
previous step
)
p ∈ tree ⊦ ∀ dirs. abs|(tree, ino0, p, ino1)(dirs) → ((abs(tree[p], ino1) -* abs(tree, ino0)))(dirs)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
abs|(tree, ino0, p, ino1)(dirs), p ∈ tree ⊦ ((abs(tree[p], ino1) -* abs(tree, ino0)))(dirs)
Rule argument
Additional information