[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 2 from proof div-abs-02 (
previous step
)
i | abs(j) ⊦ i | j
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
⊦ i | j ↔ (∃ i0. i * i0 = j)
Proof step 4
:
∃ i0. i * i0 = abs(j) ⊦ i | j
Rule argument
spec: int-gcd inst: name: divides seq: ⊦ i | j ↔ (∃ i0. i * i0 = j) subst: [j, i] → [abs(j), i] flags: rewrite, current
Additional information
Used terms: abs(j), i