[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 11 from proof denom-pos-01 (
previous step
)
0 < gcd(i, i0), abs(i0) < gcd(i, i0) ⊦ rational(i, i0).num = 0, i0 = 0, i = 0
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: ⊦ j ≠ 0 → ¬ abs(j) < gcd(i, j);