[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-create-freelist
⊦ ⟪persistence_create_freelist#(lpt; freelist)⟫ freelist-cons(lpt, freelist)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-format
,
inv-recover
,
Used by units in proved state:
persistence-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 45
Used lemmas:
create-freelist
,
Used spec theorems:
persistence-base
/
freelist-cons
array-copy
/lp-array/
subarray-at
Used simplifier rules:
oelem
/nat-set/
sls
array-copy
/lp-array/
subarray-zero
nat
/
lez
list-dup
/nat-list-set/
e-01
array
/lp-array/
Size-mkarray
nat-basic
/
zero-01
list
/nat-list-set/
in-empty
list
/nat-list-set/
Last
lprops
/
elim
list
/nat-list-set/
in-17
list
/nat-list-set/
in-append
list
/nat-list-set/
a
list-dup
/nat-list-set/
f
elem-index
/gc-heap-base/
sel-01-M03
nat
/
lels-02
nat-basic
/
f
oelem
/nat-set/
irreflexivity
nat
/
prop-07
nat
/
ls-01
nat
/
ls-le-simp
nat
/
succ-01
nat
/
lels-03
array-copy
/lp-array/
subarray-at
array-copy
/lp-array/
size-subarray
oelem
/nat-set/
ls-le
nat-basic
/
ls-02
array-copy
/lp-array/
subarray-elim
nat
/
fle-01
nat-basic
/
s-04
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
lels
nat
/
anti
nat-basic
/
lf-02
nat
/
ler
lprops
/
inj