[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-max
⊦ x ≠ [] ∧ ordered≤(x) → max(x) = x.last
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
sort-max
,
sort-max-last
,
sort-max-max-list
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 9
Used lemmas:
max-rec
,
max-base
,
Used spec theorems:
olist
/
k-le-r
Used simplifier rules:
olist
/
cons-02
list
/
c-08
list
/
c-07
nat-basic2
/
c
nat-basic2
/
a
list-data
/
l
nat-basic1
/
one-01
nat
/
succ-01
nat-basic2
/
succ
list
/
len-05
list-data
/
elim-list-c
list
/
e-01
list
/
c
list
/
a
list-last
/
l-02
oelem
/
lel
oelem
/
transitivity
oelem
/
nll
oelem
/
irreflexivity
oelem
/
nnn
list
/
app
list-last
/
l