[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 update
bin_min_heap_update#(n, key; bh, ar) {if ¬ n < bh.size then abort; let key0 = bh.ar[n].key in {bh.ar[n].key := key; if key < key0 then bin_min_heap_bubble_up#(n; bh, ar) else bin_min_heap_bubble_down#(n; bh, ar)} }
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
bin-min-heap-prepost
,
Proof exists?: No