[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-mult-01
0 ≠ j, 0 < i0 ⊦ (i0 * i) % (i0 * j) = i % j * i0
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: 0
Proof steps: 1
Used lemmas:
mod-mult-02
,
Used spec theorems:
Used simplifier rules:
int-mult
/
eq-pos
int-mult
/
commutativity
int-mult
/
associativity