[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-to-n
⊦ cleanup-lpt(lpt, # lpt) = cleanup-lpt(lpt)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
cleanup-lpt-n-at
,
cleanup-lpt-n-size
,
cleanup-lpt
,
Used spec theorems:
array
/lp-array/
Extension
array-indices
/lp-array/
map-at
Used simplifier rules:
nat-basic
/
f
nat
/
ler
array-indices
/lp-array/
map-size
oelem
/nat-set/
irreflexivity
nat
/
le-def
lprops
/
elim
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03
elem-index
/gc-heap-base/
sel-02