[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-nextoflast
⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next))
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
equalrl-settid
,
listp-enq
,
Used by units in proved state:
DMSQ-refines-DQ
,
DMSQ-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
listp-rec
,
listp-one
,
listp-empty
,
Used spec theorems:
Used simplifier rules:
list
/reflist/
c
list
/reflist/
app
list
/reflist/
a
list-last
/reflist/
last-one
list-last
/reflist/
last-rec