[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-nls-06
j ≠ 0 ⊦ abs(j) ≤ i0 + 1 → ¬ i0 < i % j
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: 4
Proof steps: 6
Used lemmas:
mod-neg
,
mod-nls-05
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-02
int-basic1
/
ls-01
int-abs
/
abs-08
int-basic1
/
lst-01
int-abs
/
abs-16
int-abs
/
absls-01
int-abs
/
forward-lels
int-abs
/
lels-01
int-abs
/
numle-02
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
add-zero-rev
int-abs
/
negle-13
int-abs
/
numleledel-01
int-abs
/
neg
int-abs
/
zero-gels-01