[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 extract-min
bin_min_heap_extract_min#(; bh, ar, n) {bin_min_heap_get_min#(bh; n); bh.size := bh.size - 1; if bh.size ≠ 0 then {bh.ar[0] := bh.ar[bh.size]; ar[bh.ar[0].idx].idx := 0; bin_min_heap_bubble_down#(0; 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