[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 eq1
⊦ 0 < m → (n + m) / m * m > n
Type: A user defined theorem
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
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:
Used spec theorems:
nat-div
/
div-succ
nat-div
/
div-succ-01
nat-div
/
rax
nat-div
/
rec
Used simplifier rules:
nat
/
lels
nat
/
gr-def
nat-basic
/
zero
nat-basic
/
add-base
nat-div
/
one
nat-mult
/
one
nat
/
lez-01
nat-basic
/
succ
nat-basic
/
s-04
nat-basic
/
oz
nat-basic
/
lf-01
nat
/
eqle-one
nat
/
les
nat
/
eq-02
nat-div
/
cond
nat
/
eq-01
nat
/
lep
nat-mult
/
rsucc-02
nat-div
/
mod-once
nat
/
le-def
nat-basic
/
f
nat
/
le-one
nat-basic
/
a
nat-basic
/
c
nat-mult
/
zero-06
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-mult
/
coef-18
nat
/
succ-01
nat-basic
/
ref