[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-free-unref-replay-lpt
n ≤ # lpt ⊦ lpt-free-unref(replay-lpt(lpt, nx, n)) ↔ lpt-free-unref(lpt)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 20
Used lemmas:
replay-lpt-at-above
,
replay-lpt-at
,
replay-lpt-size
,
lpt-free-unref
,
Used spec theorems:
Used simplifier rules:
nat
/
le-ls-simp
lprops
/
elim
nat
/
le-def
nat
/
lels
nat
/
fle-01
nat
/
lels-03
elem-index
/gc-heap-base/
sel-02
lprops
/
upd-05
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03
nat
/
fle
nat-basic
/
f
lprops
/
inj