[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 gcd-divides-01 (
previous step
)
j0 | gcd(i, j) ⊦ j0 | j
User applied rule insert lemma
And obtained the following new goals
Proof step 3
:
⊦ j | gcd(i, i0) → j | i ∧ j | i0
Rule argument
spec: int-gcd inst: name: gcd-divides-both seq: ⊦ j | gcd(i, i0) → j | i ∧ j | i0 subst: [j, i, i0] → [j0, i, j] flags: current, []
Additional information
Used terms: j0, i, j