[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 exgcd-div (
previous step
)
⊦ gcd(i, j) * i / gcd(i, j) = i
User applied rule insert lemma
And obtained the following new goals
Proof step 3
:
⊦ gcd(i, j) | i
Proof step 4
:
gcd(i, j) | i ⊦ gcd(i, j) * i / gcd(i, j) = i
Rule argument
spec: int-gcd inst: name: gcd-div1 seq: ⊦ gcd(i, j) | i subst: [i, j] → [i, j] flags: current, []
Additional information
Used terms: i, j