[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-zero-01
⊦ 0 < j ∧ 0 ≤ i → ¬ i % j < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
abs-shift
,
mod-add-zero
,
mod-ls-zero
,
mod-lsz
,
mod-nle-02
,
mod-zero
,
mod-zero-02
,
mod-zero-ls
,
mod-zero-one
,
modmod-ma
,
Used by units in proved state:
intnat
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
ls-same-pos-02
,
mod-rew
,
mod-ls-same
,
Used spec theorems:
Used simplifier rules:
int-abs
/
zero-gels-01
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
zero-gr
int-abs
/
forward-lels
int-abs
/
sub-add-01
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero-rev
int-abs
/
sub-ls
int-abs
/
zero-gels-04