[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 listp-flushauxval
⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → listp(rl, vs, ps[vs[rl.last].next, ps[vs[rl.last].next].val:= vs[vs[rl.last].next].val], owns)
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: 5
Proof steps: 10
Used lemmas:
Used spec theorems:
list-last
/reflist/
lapp
DMSQ
/
listp-postfix
Used simplifier rules:
DMSQ
/
listp-nextoflast
DMSQ
/
listp-empty
list
/reflist/
c
store
/Node-heap/
In-insert
Node
/
updsel--dotval-dotnext
store
/Node-heap/
k-At-same
Node
/
updsel--dotval-dotdeqID
store
/Node-heap/
insin
DMSQ
/
listp-one
list-last
/reflist/
last-one
list
/reflist/
a
list
/reflist/
app
Node
/
sel-mk-dotdeqID
Node
/
sel-mk-dotnext
Node
/
inj-mk
Node
/
sel-mk-dotval
store
/Node-heap/
ins