[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 ordered-last1
⊦ ordered<(x0 + x + a ' + y) ∧ x ≠ [] → x.last < a
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
ls-r
,
ordered-append
,
Used spec theorems:
list-last
/
lapp
Used simplifier rules:
list
/
a
list
/
Nil
list
/
e-03
list
/
e-01
list
/
c-08
list
/
first-01
list-data
/
elim-add
list
/
c
list
/
app
list-last
/
last-one
list-last
/
l-02