[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 sort-max-last
⊦ ¬ a < max(x + x0) → sort(x + a ' + x0) = sort(x + x0) + a '
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
sort-max-append-1
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 23
Used lemmas:
ordered-max
,
ins-max
,
max-base
,
max-rec
,
max-ins-max-last-sort
,
Used spec theorems:
olist
/
ins-less-last
Used simplifier rules:
olist-sort
/
rec
list
/
c
olist
/
ins-one-01
list
/
in-rec
list
/
in-append
olist-sort
/
in
list
/
in-15
olist
/
one-02
oelem
/
seq
oelem
/
lel
oelem
/
nen
oelem
/
ls-le
list
/
e-02
list-last
/
last-def
list
/
app-02-ant
list
/
Nil
list
/
app
olist-sort
/
one
olist-sort
/
empty
list
/
c-04
olist
/
ins-e
olist
/
ins-one-02
list
/
app-08
oelem
/
sls
list
/
app-01
list
/
a
olist
/
ins-less-last
oelem
/
nnn
oelem
/
transitivity
oelem
/
nll
oelem
/
irreflexivity