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