[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 gcdex-not-unique (conclusion)
gcd(i, j) = i * i0 + j * j0 ⊦ ∀ i1. gcd(i, j) = i * (i0 - i1 * j) + j * (j0 + i1 * i)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
gcd(i, j) = i * i0 + j * j0 ⊦ gcd(i, j) = i * (i0 - i1 * j) + j * (j0 + i1 * i)
Rule argument
Additional information