[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 ins-max
⊦ ordered≤(x0) ∧ ¬ a < max(x0) → ins≤(a, x0) = x0 + a '
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max-ins-max-last-sort
,
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: 5
Proof steps: 17
Used lemmas:
max-base
,
max-rec
,
Used spec theorems:
olist
/
cons-03
Used simplifier rules:
olist
/
ins-e
list
/
Nil
list
/
a
list
/
c-04
olist
/
cons-02
list
/
c
list
/
len-01
olist
/
ins-n
olist
/
le-r
weakord
/tord/
nll
weakord
/tord/
transitivity
weakord
/tord/
ls-le
weakord
/tord/
leq-trans
olist
/
le-o
list
/
app
tord
/
seq
weakord
/tord/
irreflexivity
weakord
/tord/
nen
list
/
c-06
olist
/
cons-03