[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-tail
x ≠ [] ⊦ (r1 => x .last × r2 * lls(r0, r1, x .butlast) * P)(H) → (¬ (lls(r0, r2, x) * P)(H) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
lls-unfold-tail
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 8
Used lemmas:
lls-base
,
lls-rec
,
Used spec theorems:
Used simplifier rules:
list-last
/
bapp
list-last
/
l-02
list
/
app
list-last
/
l
list-last
/
b
heap-sep
/cell-heap/
prop-shift
heap-sep
/cell-heap/
emp-sep
heap-sep
/cell-heap/
and-ass
heap-sep
/cell-heap/
and-com
heap-sep
/cell-heap/
and
heap-sep
/cell-heap/
prop
heap-sep
/cell-heap/
sep-com
heap-sep
/cell-heap/
sep-ass
maplet
/cell-heap/
ex1-shift
list
/
a
list
/
e-01
list
/
c