[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-lsz
⊦ 0 < j → ¬ j + i % j < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
modmod-add-law-pos
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
mod-zero-01
,
div-elim2
,
mod-less-01
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
numls-03
int-basic2
/
ls
int-abs
/
forward-le-05
int-abs
/
lels
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
zero-gels-03
int-abs
/
abs-08
int-abs
/
neg-13
int-basic1
/
ls-01
int-abs
/
zero-gels-01