[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 id-idx-freelist-cons
⊦ id-idx(lpt0, lpt1) → (freelist-cons(lpt1, freelist) ↔ freelist-cons(lpt0, freelist))
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
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: 6
Proof steps: 16
Used lemmas:
freelist-cons
,
Used spec theorems:
index-array
/gc-heap-base/
id-idx
Used simplifier rules:
lprops
/
elim
elem-index
/gc-heap-base/
sel-01-M02
elem-index
/gc-heap-base/
sel-01-M01
elem-index
/gc-heap-base/
sel-01-M03