[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
,
Theorem gcd-conq-one
0 ≤ j, 0 ≤ i, gcd(i, j) = 1 ⊦ ∃ i0. 0 ≤ i0 ∧ j | i * i0 - 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
gcd-mod-one
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 22
Used lemmas:
divides-mult-sub
,
div-one
,
gcd-com
,
gcd-zero-04
,
div-mult
,
div-neg
,
gcdex
,
Used spec theorems:
int-abs
/
le-def
int-basic2
/
add-c
int-mult
/
dist-rsplit
Used simplifier rules:
int-abs
/
neg-06
int-abs
/
num-subadd
int-abs
/
sub-sub
int-abs
/
neg-03
int-abs
/
sub-eq
int-abs
/
neg-15
int-mult
/
minus-left
int-abs
/
absle
int-mult
/
eq-one
int-basic2
/
add-zero-rev
int-mult
/
zero-left
int-abs
/
forward-le-05
int-abs
/
lels-02
int-abs
/
lels-01
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
lep-02
int-mult
/
le-same-02
int-abs
/
lels-03
int-abs
/
leone
int-basic1
/
ls-01
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int-abs
/
lels
int-abs
/
sub-add-06
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
associativity
int-mult
/
commutativity