[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 20 from proof gcd-divides-both (
previous step
)
¬ i < 0, abs(i0) = i, j | i ⊦ j | i ∧ j | i0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 21
:
j | abs(i0) ⊦ j | i0
Rule argument
Additional information
Used simplifier rules: absls: ⊦ ¬ abs(i) < 0; from specification int-abs