[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-crash
⊦ listp(rl, vs, ps, owns) → listp(rl, ps, ps, λ r. None)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Crash-Theorem
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 7
Used lemmas:
Used spec theorems:
DMSQ
/
listp-postfix
Used simplifier rules:
DMSQ
/
listp-empty
list
/reflist/
c
list
/reflist/
app
list
/reflist/
a
DMSQ
/
listp-one
opttid
/
weak-notnone
DMSQ
/
listp-rec