[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 3 from proof gcd-div-rest (
previous step
)
i = i1 * gcd(i, j) + j0, abs(j0) < gcd(i, j) ⊦ j0 = 0, i = i1 * gcd(i, j) ∧ j0 = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
i = i1 * gcd(i, j) + j0, abs(j0) < gcd(i, j) ⊦ j0 = 0
Rule argument
Additional information