[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 valid-idx
⊦ valid-idx(kar, ar, n) ↔ n ≤ # kar ∧ (∀ m. m < n → kar[m].idx < # ar ∧ ar[kar[m].idx].idx = m)
Type: An axiom
Validity: The proof is valid.
Features: lws,
Comment:
Used by:
key-index-in-keyset-array-extract
,
valid-idx-0
,
valid-idx-imp-1
,
valid-idx-last-valid
,
valid-idx-move-last
,
valid-idx-outofbounds
,
valid-idx-rec
,
valid-idx-remlast
,
valid-idx-update-key
,
valid-idx-xhg
,
Used by units in proved state:
bin-min-heap-prepost
,
Proof exists?: No