[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 12 from proof prime-divides-pot (
previous step
)
¬(prime(i) ∧ ¬ i | i0 ^ i1), i * j = i0 ^ i1 * i0, prime(i), 0 ≤ i1 ⊦ gcd(i, i0 ^ i1) = 1, i | i0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 13
:
i * j = i0 ^ i1 * i0, prime(i), 0 ≤ i1, i | i0 ^ i1 ⊦ gcd(i, i0 ^ i1) = 1, i | i0
Rule argument
Additional information