[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 elim-list-c
x ≠ [] ⊦ a = x.first ∧ y = x.rest ↔ x = a + y
Type: A user defined theorem
Validity: The proof is valid.
Features: elim,
Comment:
Used by:
eq-one
,
fr-02
,
fr-04
,
fr-07
,
length-rest
,
lf-01
,
lr-01
,
Used by units in proved state:
list-last
,
list-del
,
stream
,
list
,
path-reachable
,
olist-sort
,
olist-min-max
,
olist
,
list-set
,
list-perm
,
infinite-append
,
assoclist
,
list-dup
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
f
,
gen
,
sel-2
,
sel-1
,
Used spec theorems:
Used simplifier rules: