[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 2 from proof coprime-divides-02 (
previous step
)
gcd(i, j) = 1, i | j * j0 ⊦ i | j0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
⊦ gcd(i, j) = 1 ∧ i | j * j0 → i | j0
Rule argument
spec: int-gcd inst: name: coprime-divides-01 seq: ⊦ gcd(i, j) = 1 ∧ i | j * j0 → i | j0 subst: [i, j, j0] → [i, j, j0] flags: rewrite, current
Additional information
Used terms: i, j, j0