[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 heap-order
⊦ heap-order(kar, n) ↔ (∀ m. m < n ∧ m ≠ 0 → ¬ kar[m].key < kar[(m - 1) / 2].key)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
heap-order-0
,
heap-order-1
,
heap-order-add-parent-key
,
heap-order-add-smaller
,
heap-order-min
,
heap-order-overwrite-children-at
,
heap-order-overwrite-children-ok
,
heap-order-overwrite-parent-ok
,
heap-order-overwrite0
,
heap-order-pull-down-parent
,
heap-order-pull-up-child
,
heap-order-remove-last
,
Used by units in proved state:
bin-min-heap-prepost
,
Proof exists?: No