[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 no-dups-idx
⊦ no-dups-idx(kar, n) ↔ (∀ m0, m1. m0 < # kar ∧ m0 < n ∧ m1 < # kar ∧ m1 < n ∧ m0 ≠ m1 → kar[m0].idx ≠ kar[m1].idx)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
key-set-write-nodups
,
no-dups-idx-0
,
no-dups-idx-mvlast
,
no-dups-idx-rec
,
no-dups-idx-rem1
,
no-dups-idx-remlast
,
no-dups-idx-xchg
,
no-dups-update-key
,
valid-idx-rec
,
Used by units in proved state:
bin-min-heap-prepost
,
Proof exists?: No