[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 next-in-list-app2
⊦ listp(orl + qrl, vs, ps, owns) ∧ r ∈ qrl ∧ ps[r] = mk(val, opttid, nxt) → nxt = null ∨ nxt ∈ qrl ∧ nxt ∈ vs ∧ nxt ∈ ps
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
next-in-list
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 29
Used lemmas:
listp-rec
,
listp-empty
,
listp-one
,
listp-nodups
,
list-elem-in-app21
,
list-elem-in-app22
,
Used spec theorems:
Used simplifier rules:
list
/reflist/
a
list
/reflist/
Nil
list
/reflist/
in-empty
list
/reflist/
in-rec
list
/reflist/
c
list-dup
/reflist/
rec
list
/reflist/
app
list-dup
/reflist/
e-01
Node
/
sel-mk-dotval
Node
/
sel-mk-dotnext
list
/reflist/
in-06
Node
/
sel-mk-dotdeqID
Node
/
elim