[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 22 from proof repalyone-monotonic (
previous step
)
datanode(key0, buf) = fs[adr], inodekey(key0.ino) ∈ ri0, ∀ key. key ∈ ri0 → key ∈ ri1 ⊦ key0 ∈ ri0, key0 ∈ ri1, inodekey(key0.ino) ∈ ri1
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: inodekey(key0.ino)
Additional information
Used terms: inodekey(key0.ino)