[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-le-diff-third
⊦ n2 ≤ n2 - min(n0, n1, n2) ↔ n0 = 0 ∨ n1 = 0 ∨ n2 = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 15
Used lemmas:
min3
,
Used spec theorems:
min-max
/
min
Used simplifier rules:
nat-basic
/
zero-01
nat-basic
/
zero
nat
/
sub-base
nat
/
lez
nat-basic
/
ls-02
nat-basic
/
lf
oelem
/nat-set/
transitivity
nat-basic
/
succ
nat
/
zero
nat
/
le-ls-simp
nat
/
le-def
oelem
/nat-set/
irreflexivity
oelem
/nat-set/
ls-le
nat
/
ls-02
nat
/
elim-sub
nat-basic
/
eq-02
nat-basic
/
a
nat-basic
/
c
nat
/
ler
nat
/
lels
nat
/
let
nat
/
lez-01
nat
/
lels-03
nat-basic
/
f
nat-basic
/
lf-01
nat
/
fle
nat-basic
/
l-01
nat
/
le-add