[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 freelist-cons-alloc
lpf ≠ LP_FREE ⊦ freelist-cons(lpt, n ' + freelist) → freelist-cons(lpt[n, mklp(m0, m1, lpf, m2)], freelist)
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: 0
Proof steps: 6
Used lemmas:
freelist-cons
,
Used spec theorems:
Used simplifier rules:
array
/lp-array/
Size-put
list
/nat-list-set/
in-rec
list
/nat-list-set/
a
list-dup
/nat-list-set/
rec
lprops
/
elim
nat
/
lels
nat
/
le-ls-simp
array
/lp-array/
cgetput
lprops
/
inj
array
/lp-array/
Put-other
elem-index
/gc-heap-base/
sel-01-M03