[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-read-above
n ≤ m, m < # lpt ⊦ cleanup-lpt(lpt, n)[m] = lpt[m]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
cleanup-lpt-n-at
,
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 9
Used lemmas:
cleanup-lpt-rec
,
cleanup-lpt-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
l-02
nat
/
fle-01
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
nat
/
fle
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat
/
lels
nat-basic
/
succ
lprops
/
elim
array
/lp-array/
ngp-06
nat
/
lels-03