[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 max-ins-max-last-sort
⊦ ¬ a < max(x0) → ins≤(a, sort(x0)) = sort(x0) + a '
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
sort-max-last
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
sort-max-max-list
,
max-ins-max-last
,
Used spec theorems:
Used simplifier rules:
oelem
/
nll
olist-sort
/
Ordered
olist-sort
/
empty
olist
/
ins-e
list
/
Nil
list
/
a
list
/
c-04