[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-09
j ≠ 0 ⊦ (i % j * i0) % j = (i * i0) % j
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 5
Used lemmas:
mod-neg
,
modmod-mult-07
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-02
int-basic1
/
ls-01
int-basic1
/
lst-01
int-abs
/
neg
int-abs
/
zero-gels-01