[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 1 from proof gcd-num-one (conclusion)
⊦ rj.num ≠ 0 → gcd(rj.num, rj.denom) = 1
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
⊦ rj.num = 0, gcd(rj.num, rj.denom) = 1
Rule argument
Additional information