[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 last-ex
a ≠ x.last, a ∈ x ⊦ ∃ y, z. x = y + a ' + z ∧ z ≠ []
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
last-elim
,
Used spec theorems:
list
/
In
Used simplifier rules:
list
/
in-empty
list
/
in-17
list
/
in-append
list
/
c
list
/
a
list
/
e-02