[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 bin-heap-inv-cleanup-lpt
⊦ bin-heap-inv(gch, cleanup-lpt(lpt)) ↔ bin-heap-inv(gch, lpt)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 30
Used lemmas:
cleanup-lpt
,
Used spec theorems:
bin-min-heap-prepost
/gc-heap-rename-gc-heap-base/
bin-heap-inv-def
bin-min-heap-inv
/gc-heap-rename-gc-heap-base/
valid-idx
array-indices
/lp-array/
map-at
Used simplifier rules:
bin-min-heap
/gc-heap-base/
elim
bin-min-heap
/gc-heap-base/
sel-02
bin-min-heap
/gc-heap-base/
sel-01
array-indices
/lp-array/
map-size
lprops
/
elim
key-index
/gc-heap-rename-gc-heap-base/
elim
key-index
/gc-heap-rename-gc-heap-base/
sel-01
nat-basic
/
lf-02
nat-basic
/
f
elem-index
/gc-heap-base/
sel-02
elem-index
/gc-heap-base/
sel-01-M03
elem-index
/gc-heap-base/
sel-01-M01
nat
/
fle
lprops
/
inj