[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 9 from proof path-links-empty (
previous step
)
links(n, dirs) = ∅, ispath(p, ino, n, dirs, files), ino ∈ dirs ⊦ ∀ p0, str. p ≠ p0 + str '
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
links(n, dirs) = ∅, ispath(p0 + str ', ino, n, dirs, files), ino ∈ dirs ⊦
Rule argument
Additional information