[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 prime-pot-eq
⊦ prime(i) ∧ 0 < i0 ∧ 0 < i1 ∧ ¬ i | j ∧ ¬ i | j0 → (i ^ i0 * j = i ^ i1 * j0 ↔ i ^ i0 = i ^ i1 ∧ 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: 11
Proof steps: 17
Used lemmas:
Used spec theorems:
int-mult
/
eq-nonzero
int-mult
/
eq-nonzero-01
int-pot
/
Pot-pos
Used simplifier rules:
int-abs
/
forward-le-05
int-mult
/
Mult-zero
int-gcd
/
prime-not-neg-01
intnat
/
abs-pred
int-basic1
/
forward-pos
oelem
/intlista/
lel
int-mult
/
one-01
int-mult
/
one
int-pot
/
Pot-zero
int-abs
/
sub-eq-01
int-abs
/
bet
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
lsone
int-basic1
/
lst-01
int-abs
/
sub-pred
int-abs
/
sub-sub
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-ls-01
int-abs
/
numlelsdel-01
int-gcd
/
prime-divides
int-gcd
/
div-zero
int-mult
/
associativity
int-mult
/
commutativity