[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 dlls-null
⊦ dlls(null, r0, r1, x) = (emp ∧ ⌜r1 = null⌝ ∧ ⌜x = []⌝ )
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
dlls-rec
,
dlls-base
,
Used spec theorems:
Used simplifier rules:
map-sep
/
true-rev
map-sep
/
true-and
map-sep
/
And-inj
map-sep
/
and-ass
map-sep
/
and-com
map-sep
/
false-and
map-sep
/
false-rev
list
/
a
list
/
e
list
/
app-02
list
/
c
map-sep
/
sep-com
map-sep
/
sep-ass
map-sep
/
false-sep
refmap-maplet
/
map-null
refmap-maplet
/
ex
map-sep
/
falseH