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