[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 prepost-replay-log
lpt0 = lpt, nx0 = nx, valid-indices(lpt0, nx), ¬ dups(nx) ⊦ ⟪persistence_replay_log#(LEB_SIZE; nx, lpt)⟫ (lpt = replay-log(lpt0, nx0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-recover
,
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 13
Used lemmas:
elim-lp-upd-size
,
replay-log
,
Used spec theorems:
Used simplifier rules:
list
/nat-list-set/
app
list
/nat-list-set/
app-05
persistence-base
/
replay-log-base
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
oelem
/nat-set/
irreflexivity
nat-basic
/
s-04
nat
/
ls-01
list-data
/nat-list-set/
l
nat-basic
/
one-01
nat
/
le-def
nat
/
pred-03
list-data
/nat-list-set/
length-rest
array-indices
/lp-array/
valid-indices-write
array
/lp-array/
cputput
lprops
/
updsel-15
lprops
/
updsel-01
lprops
/
updsel-07
array
/lp-array/
cgetput
array
/lp-array/
Size-put
list-dup
/nat-list-set/
dups-cons
list-dup
/nat-list-set/
f-01
list
/nat-list-set/
app-03
nat
/
ls-le-simp
persistence-base
/
replay-log-at-other
persistence-base
/
replay-log-append-one
list-dup
/nat-list-set/
a
nat
/
lels
list
/nat-list-set/
c
list
/nat-list-set/
e-01
list
/nat-list-set/
a
array-indices
/lp-array/
valid-indices-append
array-indices
/lp-array/
valid-indices-one
persistence-base
/
replay-log-size
nat
/
le-ls-simp
list-data
/nat-list-set/
elim-list-c