[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 9 from proof square-neq-pos (
previous step
)
j ≠ 0, j / gcd(j, j0) * j = (i * j0 * j0) / gcd(j, j0), prime(i), 0 < j, 0 ≤ j0 ⊦ gcd(j, j0) = 1
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
j / gcd(j, j0) * j = (i * j0 * j0) / gcd(j, j0), prime(i), 0 < j, 0 ≤ j0 ⊦ gcd(j, j0) = 1, j = 0
Rule argument
Additional information