[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 80 from proof prepost-remove (
previous step
)
n ≤ # kar, m < n ⊦ heap-order(kar, n) ∧ 2 * m + 1 < n ∧ ki = (2 * m + 2 < n ∧ kar[2 * m + 2].key < kar[2 * m + 1].key ⊃ kar[2 * m + 2];kar[2 * m + 1]) → (¬ heap-order(kar[m, ki], n) ↔ false)
A spec-lemma