[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 1 from proof path-fold (conclusion)
⊦ ((abs|(tree, ino0, p, ino1) * abs(tree[p], ino1)))(dirs) ∧ p ∈ tree → abs(tree, ino0)(dirs)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
((abs|(tree, ino0, p, ino1) * abs(tree[p], ino1)))(dirs), p ∈ tree ⊦ abs(tree, ino0)(dirs)
Rule argument
Additional information