[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 15 from proof replay-orphans-del (
previous step
)
key0 ∈ ri, key0.data? → ¬ inodekey(key0.ino) ∈ ro ⊦ ri[key0] = ((ri -- key) ⊖ ro)[key0], key0 = key, key0.data?, key ∈ ro, key0 ∈ ro
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 16
:
key0 ∈ ri ⊦ ri[key0] = ((ri -- key) ⊖ ro)[key0], key0 = key, key0.data?, key0 ∈ ro, key ∈ ro
Rule argument
Additional information