[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
,
Proof step 6 from proof coprime-mod-zero (
previous step
)
(i * i0) % j = 0, gcd(i, j) = 1 ⊦ j | i * i0, j = 0, i0 % j = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 7
:
⊦ i ≠ 0 → (i | j ↔ j % i = 0)
Rule argument
spec: inst: name: divides-mod seq: ⊦ i ≠ 0 → (i | j ↔ j % i = 0) subst: [j, i] → [i * i0, j] flags: rewrite, current
Additional information
Used terms: i * i0, j