[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 replay-lpt-size
n ≤ # lpt ⊦ # replay-lpt(lpt, nx, n) = # lpt
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-gstore-crash
,
abs-gstore-replay-lpt-unchanged
,
abs-istore-crash
,
abs-istore-replay-lpt-unchanged
,
lpt-free-unref-replay-lpt
,
replay-lpt-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: 15
Used lemmas:
replay-lpt-rec
,
replay-lpt-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
le-ls-simp
nat
/
succ-01
nat
/
lels
nat-basic
/
succ
lprops
/
elim
lprops
/
upd-05
nat
/
lels-03
lprops
/
disj-03
array
/lp-array/
Size-put