[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 allslotsfull-def
⊦ allslotsfull(ar, n0, n, e, b) ↔ (∀ m. between(n0, m, n, b) ∧ m < # ar → ar[m] ≠ e ∧ ar[m] ≠ ⊥)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment: all slots between hash value and index of element are not ⊥ and not the given element.
Used by:
allslotsfull-final
,
allslotsfull-final-close
,
allslotsfull-inc
,
allslotsfull-incfalse
,
allslotsfull-inctrue
,
allslotsfull-init
,
allslotsfull-iterate
,
htok-add
,
htok-returnfalse-f
,
rely-allslotsfull
,
Used by units in proved state:
Hashset-refines-Set
,
Hashset-proofs
,
Proof exists?: No