[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 coprime-pot
⊦ gcd(i, j) = 1 ∧ 1 < i ∧ 0 < j0 ∧ j ≠ 0 → i * i0 ≠ j ^ j0
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: 5
Proof steps: 12
Used lemmas:
divides
,
coprime-divides
,
Used spec theorems:
int-pot
/
Pot-pos
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
sub-pred
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numlelsdel-01
int-abs
/
lels
int-abs
/
anti
int-pot
/
Pot-zero
int-mult
/
eq-one
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
one
int-basic1
/
lf-02
int-abs
/
abs-16
int-mult
/
one-01
int-basic1
/
forward-pos
intnat
/
rax-04
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
int-basic1
/
irref
nat-basic2
/
a
nat-basic2
/
c