[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-rec
⊦ ints ≠ [] → min(i ' + ints) = min(i, min(ints))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
count-i2j-min
,
divide-list-at-value
,
filterFun-min
,
min-del-nlz
,
min-del-nlz-01
,
min-in-nle
,
min-in-nls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 20
Used lemmas:
min-in-not-ls
,
min-in
,
min-def
,
Used spec theorems:
int-min
/
Min-right
list
/intlista/
in-rec
Used simplifier rules:
list
/intlista/
in-17
list
/intlista/
in-append
list
/intlista/
c
int-min
/
min-c
int-min
/
min-a
int-min
/
Min-left
int-abs
/
lels-03
list
/intlista/
e-01
list
/intlista/
a
int-abs
/
lels
int-abs
/
lels-02
oelem
/intlista/
transitivity
int-abs
/
forward-lsle
oelem
/intlista/
lel
int-abs
/
forward-lels
int-abs
/
forward-lele
int-basic1
/
ls-01