[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 mod-nle-02
⊦ j0 ≤ ~ j ∧ 0 < j → ¬ i % j ≤ j0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
mod-zero-01
,
div-elim-negpos
,
mod-less-01
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
ls
int-abs
/
negle-07
int-abs
/
lels
int-abs
/
zero-gels-03
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
forward-le-05
int-basic1
/
lf-01
int-basic1
/
trans
int-abs
/
forward-le-02
int-abs
/
forward-lels
int-abs
/
forward-le-04
int-basic2
/
succ-01
int-basic2
/
ls-01
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
lst-03
int-basic2
/
add-less
int-abs
/
lenls
int-abs
/
zero-gels-01