[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
,
Theorem indices-erasing-rec
⊦ indices-erasing(wlar, n ' + nx) ↔ n < # wlar ∧ wlar[n].status = erasing ∧ indices-erasing(wlar, nx)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
indices-erasing-at
,
indices-erasing-eraseq
,
indices-erasing-write-notin
,
indices-erasing-write-prepend
,
indices-set-erasing
,
Used by units in proved state:
ubi-asm
,
Proof exists?: No