[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-del-nlz-01
⊦ 0 < min(ints) → ¬ min(ints -l i0) < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
min-del-nlz
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
min-one
,
min-rec
,
min-empty
,
Used spec theorems:
list-del
/intlista/
del-one-simp
list-del
/intlista/
del-n
int-min
/
Min-right
Used simplifier rules:
list-del
/intlista/
del-e
list
/intlista/
c
int-basic1
/
ls-01
list-del
/intlista/
one
int-abs
/
forward-le-05
int-abs
/
forward-le-04
int-abs
/
forward-lels
list-del
/intlista/
del-y
list
/intlista/
app
list
/intlista/
a
oelem
/intlista/
irreflexivity
int-min
/
Min-left
int-min
/
min-a
int-min
/
min-c
int-min
/
min-03
int-abs
/
forward-le-02
oelem
/intlista/
transitivity
int-abs
/
lels