[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-ordered
⊦ x ≠ [] ∧ max(x + x0) = max(x) ∧ ordered≤(x0) ∧ x1 ⊑ x0 → (max(x + x1) = max(x + x0) ↔ true)
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: 14
Proof steps: 41
Used lemmas:
max-ge
,
max-base
,
max-rec
,
Used spec theorems:
olist
/
orderedle-all
list-last
/
prefix
Used simplifier rules:
list
/
c
list
/
a
list
/
e-01
list
/
app-02
list
/
Nil
list
/
app
tord
/
sls
weakord
/tord/
transitivity
list-last
/
prefix-empty
weakord
/tord/
irreflexivity