[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 bin-heap-inv-def
⊦ bin-heap-inv(bh, ar) ↔ bh.size ≤ # bh.ar ∧ no-dups-idx(bh.ar, bh.size) ∧ valid-idx(bh.ar, ar, bh.size) ∧ 2exp-size(# bh.ar) ∧ heap-order(bh.ar, bh.size)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
key-set-in
,
keyset-eq-empty
,
prepost-empty
,
prepost-extract-min
,
prepost-get-min
,
prepost-insert
,
prepost-remove
,
prepost-resize
,
prepost-update
,
Used by units in proved state:
Proof exists?: No