[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
,
Proof step 25 from proof prepost-get-min (
previous step
)
⊦ n ≠ 0 ∧ n ≤ # kar ∧ heap-order(kar, n) ∧ m < n ∧ m ≠ 0 → ¬ kar[m].key < kar[0].key
A spec-lemma