[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-abs-rew-02 (
previous step
)
¬ ¬ gcd(i, j) < gcd(abs(i), abs(j)) ⊦ gcd(i, j) = gcd(abs(i), abs(j))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
gcd(i, j) < gcd(abs(i), abs(j)) ⊦ gcd(i, j) = gcd(abs(i), abs(j))
Rule argument
Additional information