[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-log-append-one
⊦ ¬ n ∈ nx → replay-log(lpt, nx + n ') = replay-log(lpt, nx)[n, mklp(lpt[n].ref-size, LEB_SIZE, LP_GROUP_NODES, lpt[n].gcheapidx)]
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: 4
Proof steps: 10
Used lemmas:
replay-log
,
Used spec theorems:
array
/lp-array/
Extension
array
/lp-array/
Put-other
array-indices
/lp-array/
mapindices-at
Used simplifier rules:
list
/nat-list-set/
a
apersistence-base
/
elems-append
lprops
/
elim
nat-basic
/
f
array
/lp-array/
Size-put
set-basic
/nat-set/
In-insert
array-indices
/lp-array/
mapindices-size
nat
/
lels
nat
/
ls-le-simp
array
/lp-array/
cgetput
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-02
apersistence-base
/
elems-def