[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-app
⊦ x ≠ [] ∧ y ≠ [] → max(x + y) = max(max(x), max(y))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
depths-max
,
max-gt-app
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 26
Used lemmas:
max-rec
,
max-one
,
Used spec theorems:
int-min
/
Max-left
Used simplifier rules:
int-abs
/
lels
int-min
/
Min-right
nat
/
lels
nat
/
le-add
list
/intlist/
app-02-ant
nat-basic1
/
one
nat
/
add-num-03
int-min
/
Min-left
int-min
/
Max-right
int-min
/
min-c
int-min
/
min-a
int-min
/
min-03
int-min
/
max-01
int-min
/
max-c
int-min
/
max-a
int-min
/
max
list
/intlist/
e
list
/intlist/
len-02
list
/intlist/
len
nat-basic2
/
l
nat-basic2
/
a
nat-basic2
/
c
list
/intlist/
app
list
/intlist/
Nil
list
/intlist/
a
list
/intlist/
e-01
list
/intlist/
c