[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 div-ls-modzero
⊦ i % j = 0 ∧ 0 ≤ i ∧ 0 < j → (i0 < i / j ↔ i0 * j < i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
div-le-modzero-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
div-mult-03
,
modex
,
mult-ls-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
lels
int-mult
/
ls-pos
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
lels-03
int-mult
/
zero-left