[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 app-02
⊦ x + y = [] ↔ x = [] ∧ y = []
Type: A user defined theorem
Validity: The proof is valid.
Features: as, lws,
Comment:
Used by:
app-09
,
c-05
,
e-02
,
e-03
,
first-app
,
firstrest
,
inapp
,
one
,
one-01
,
Used by units in proved state:
list-del
,
olist-min-max
,
olist
,
stream
,
list-set
,
path-reachable
,
list-dup
,
list-last
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
e-01
,
c
,
a
,
Nil
,
Used spec theorems:
Used simplifier rules: