[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-unfold-head-simp
r0 ≠ r2 ⊦ h[r0] = ce → (((lls(r0, r2, x) * hP))(h) ↔ (∃ a, y, r1. ((r0 => a × r1 * lls(r1, r2, y) * hP))(h) ∧ x = a ' + y))
Type: A user defined theorem
Validity: The proof is valid.
Features: as,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
lls-base
,
lls-unfold-head
,
Used spec theorems:
Used simplifier rules:
heap-sep
/
false-rev
heap-sep
/
false-and
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/
false-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
heap-sep
/
falseH
list
/
e-01
list
/
a