[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-links-empty (conclusion)
⊦ ispath(p, ino, n, dirs, files) → (# links(n, dirs) = 0 ↔ p = ε ∧ links(ino, dirs) = ∅)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
ispath(p, ino, n, dirs, files) ⊦ # links(n, dirs) = 0 ↔ p = ε ∧ links(ino, dirs) = ∅
Rule argument
Additional information