[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
⊦ min(n, m) = (n < m ⊃ n;m)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
min-0-left
,
min-0-right
,
min-add
,
min-add-l-and-r
,
min-add-same
,
min-comm
,
min-l-and-r
,
min-le-left
,
min-le-leftn
,
min-ls-add
,
min-ls-right
,
min-ls1-right
,
min-not-ls-add
,
min-notls1
,
min-notls2
,
min-same
,
Used by units in proved state:
array-splice
,
datasize
,
array-splice
,
Proof exists?: No