[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 denom-not-zero (
previous step
)
abs(i0) / gcd(i, i0) = 0 ⊦ i = 0, i0 = 0
User applied rule insert spec-lemma
And obtained the following new goals
Proof step 7
:
⊦ 0 ≤ gcd(i, j)
Proof step 8
:
0 ≤ gcd(i, i0), abs(i0) / gcd(i, i0) = 0 ⊦ i = 0, i0 = 0
Rule argument
seq: ⊦ 0 ≤ gcd(i, j) subst: [i, j] → [i, i0] rotate: F spec: int-gcd inst: name: gcd-pos
Additional information
Used terms: i, i0