[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 19 from proof prepost-cleanup-lpt (
previous step
)
bin-heap-inv(bh, lpt), lpt0 = lpt, bh0 = bh, key-index(natkey, m) ∈ keyset(bh0), lpt[m].gcheapidx = n ⊦ ⟪gc_heap_remove#(n; bh, lpt)⟫ (bin-heap-inv(bh, lpt) ∧ id-idx(lpt0, lpt) ∧ keyset(bh) = keyset(bh0) -- key-index(natkey, m))
A spec-lemma