[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-distr
⊦ min(m + 1, n + 1) = min(m, n) + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 3
Used lemmas:
Min-right
,
min-c
,
min-a
,
Min-left
,
Used spec theorems:
Used simplifier rules:
nat
/
lels
nat-basic2
/
l
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
nat
/
le-ls-simp