[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 14 from proof del-del-again (
previous step
)
⊦ datakey(ino, n) ∈ ri ∧ datakey(ino, n) ≠ key0 ∧ inodekey(ino) ≠ key0 → (ri ⊖ key0)[datakey(ino, n)] = ri[datakey(ino, n)]
Lemma
at-del-ro-data