[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 2 from proof gcd-mod-one-01 (
previous step
)
gcd(m, n) = 1, 1 < n, m ≠ 0 ⊦ ∃ m0. (m * m0) % n = 1
Lemma
gcd-mod-one