[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 min-concat
⊦ x ≠ [] ∧ y ≠ [] → min(x + y) = min(min(x), min(y))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
depths-min
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
min-rec
,
min-one
,
Used spec theorems:
int-min
/
Max-left
Used simplifier rules:
int-min
/
Min-left
int-min
/
max-c
int-min
/
max-a
int-min
/
Max-right
int-min
/
min-a
int-min
/
min-c
int-min
/
Min-right
int-abs
/
lels
int-min
/
min-right
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