[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 lls-fold-head
⊦ ((r0 => a × r1 * lls(r1, r2, x) * hP))(h) ↔ ((lls(r0, r2, a ' + x) * hP))(h) ∧ True(h[r0].nxt = r1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
lls-rec
,
Used spec theorems:
separation
/cell-heap/
True
Used simplifier rules:
heap-sep
/
sep-com
heap-sep
/
sep-ass
maplet
/cell-heap/
ex1-shift
list
/
a
cell
/
elim-tim
cell
/
inj-tim
maplet
/cell-heap/
at-eq