[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 13 from proof abs-keys-orphans (
previous step
)
ro.inodes?, ∀ ino. inodekey(ino) ∈ ro ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO ⊦ inodekey(m) ∈ ro ↔ inodekey(m) ∈ ri ∧ fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO
User applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: m abort: F discard: F computed: T
Additional information
Used terms: m