[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-one-eq
⊦ j2 / gcd(i2, j2) = 1 → gcd(i2, j2) = j2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
gcd-negone-eq
,
gcd-one-eq-01
,
gcd-one-eq-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
gcd-less-eq-zero
,
gcd-zero
,
gcd-zero-04
,
gcd-div2
,
gcd-zero-zero
,
div-eq-one
,
gcd-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
abs-07
int-div
/
zero
int-abs
/
forward-le-05
int-abs
/
lels-02
int-abs
/
forward-le-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
ge-def
int-abs
/
lels
int-basic1
/
lf-02
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
zero-gels-01
int-div
/
div-elim-negpos