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