[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 cleanup-lpt-n-at
m < n, n ≤ # lpt ⊦ cleanup-lpt(lpt, n)[m] = (lpt[m].ref-size = 0 ∧ lpt[m].flags ≠ LP_FREE ⊃ mklp(0, 0, LP_FREE, lpt[m].gcheapidx);lpt[m])
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
cleanup-lpt-to-n
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 11
Used lemmas:
cleanup-lpt-n-read-above
,
cleanup-lpt-n-size
,
cleanup-lpt-rec
,
cleanup-lpt-base
,
Used spec theorems:
Used simplifier rules:
nat
/
fle
nat-basic
/
f
lprops
/
elim
nat
/
lez
nat-basic
/
zero-01
nat-basic
/
s-04
nat-basic
/
c
nat-basic
/
a
nat
/
le-ls-simp
nat
/
succ-01
nat-basic
/
succ
nat
/
anti
oelem
/nat-set/
sls
nat-basic
/
ls-02
nat-basic
/
lf-02
array
/lp-array/
Put-other
nat
/
lels-02
nat
/
lels-03
nat
/
lels
nat
/
ls-le-simp
array
/lp-array/
cgetput
nat
/
ler
oelem
/nat-set/
irreflexivity
lprops
/
inj