[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-negone-eq
⊦ ~1 = j2 / gcd(i2, j2) → gcd(i2, j2) = ~ j2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 5
Used lemmas:
gcd-zero
,
gcd-zero-zero
,
gcd-pos
,
gcd-com
,
gcd-neg
,
gcd-one-eq
,
Used spec theorems:
int-div
/
num-neg
Used simplifier rules:
int-div
/
neg-01
int-abs
/
neg-02
int-abs
/
negeq
int-abs
/
numadd-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-le-01