[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-a
⊦ min(m, min(n, n0)) = min(min(m, n), n0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
min-c
,
min-distr
,
min-i
,
min-ls-both
,
min-ls-self1
,
min-ls-self2
,
min-neq1
,
min-neq2
,
min-zero1
,
min-zero2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 15
Used lemmas:
Min-right
,
Min-left
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
lf
nat-basic1
/
trans-1
nat
/
lels
nat
/
le-ls-simp
nat
/
fle
nat-basic1
/
f
nat-basic1
/
ref-1