[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 55 from proof prepost-create-gcheap (
previous step
)
gc-heap(lpt, log, n) = keyset(gch), gch0 = bin-heap(mkkeyarray(1), 0), log = nx, lpt = lpt1, lpt0 = lpt2, n = n0, n1 = 0, n < # lpt, bin-heap-inv(gch, lpt), id-idx(lpt2, lpt), n ≤ # lpt ⊦ n < # lpt
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information