[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 modmod-mult-03
j ≠ 0 ⊦ 0 < j0 → (i % (j * j0)) % j = i % j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
modmod-mult-05
,
Used by units in proved state:
int-pot
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
mod-neg-01
,
mod-neg
,
modmod-mult-04
,
Used spec theorems:
Used simplifier rules:
int-abs
/
neg
int-abs
/
zero-gels-01
int-mult
/
minus-left
int-abs
/
neg-10
int-basic2
/
succ-01
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
lels-01
int-basic1
/
ls-01
int-basic1
/
lst-01
int-abs
/
negle-07
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-03
int-mult
/
zero-neq-01
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
zero-left
int-abs
/
numls-03
int-abs
/
neg-12