[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 lpt-free-unref-write
⊦ lpt-free-unref(lpt) → (lpt-free-unref(lpt[n, lp]) ↔ n < # lpt ∧ lp.flags = LP_FREE → lp.ref-size = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-refine
,
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 15
Used lemmas:
lpt-free-unref
,
Used spec theorems:
Used simplifier rules:
array
/lp-array/
Size-put
lprops
/
elim
nat-basic
/
f
array
/lp-array/
Put-same
lprops
/
inj
array
/lp-array/
Put-other
elem-index
/gc-heap-base/
sel-01-M03
elem-index
/gc-heap-base/
sel-01-M01