[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 10 from proof gcd-one-eq (
previous step
)
j2 / gcd(i2, j2) = 1, 0 < j2, 0 < gcd(i2, j2) ⊦ j2 = 0, gcd(i2, j2) = j2, gcd(i2, j2) = 0, gcd(i2, j2) | j2
User applied rule insert lemma
And obtained the following new goals
Proof step 11
:
⊦ gcd(i, j) | j
Rule argument
spec: int-gcd inst: name: gcd-div2 seq: ⊦ gcd(i, j) | j subst: [i, j] → [i2, j2] flags: current, []
Additional information
Used terms: i2, j2