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