[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 18 from proof gcd-one (
previous step
)
⊦ gcd(i, j) | j, gcd(i, j) = 1, ∃ i0. 1 < i0 ∧ i0 | i ∧ i0 | j
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 19
:
⊦ gcd(i, j) = 1, gcd(i, j) | j, ∃ i0. 1 < i0 ∧ i0 | i ∧ i0 | j
Rule argument
Additional information