[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 59 from proof gcd-rec-sub-03 (
previous step
)
0 < i, i0 < i, i0 ≤ 0 ⊦ gcd(i, i0 + i) = gcd(i0 + i, i0), i = 0
User applied rule cut formula
And obtained the following new goals
Proof step 60
:
i0 < i, 0 < i, i0 ≤ 0 ⊦ gcd(i, i0 + i) = gcd(i0 + i, i0), i = 0
Rule argument
fma: i = 0
Additional information
Used formulas: i = 0