[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 htok-def
⊦ htok(ar) ↔ (∀ n. n < # ar ∧ ar[n] ≠ ⊥ → allslotsfull(ar, get_hash(ar[n], # ar), n, ar[n], false))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment: for all elements ar[n], the slots between its hash and n are occupied with different elements
Used by:
htok-add
,
htok-returnfalse-f
,
Used by units in proved state:
Hashset-proofs
,
Proof exists?: No