[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 lpt-leb-size-cleanup
⊦ lpt-leb-size(lpt) → lpt-leb-size(cleanup-lpt(lpt))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 11
Used lemmas:
cleanup-lpt
,
lpt-leb-size
,
Used spec theorems:
array-indices
/lp-array/
map-at
Used simplifier rules:
nat
/
le-def
array-indices
/lp-array/
map-size
lprops
/
elim
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-01
lprops
/
inj
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
lf-02
nat
/
le-ls-simp