[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 max_exp-div-not
⊦ ∃ i, j, j0. 0 < j ∧ 0 < j0 ∧ prime(i) ∧ ¬ j0 | j ∧ max_exp(i, j / j0) ≠ max_exp(i, j) - max_exp(i, 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: 7
Proof steps: 15
Used lemmas:
max_exp-zero-01
,
max_exp-same
,
max_exp-rec
,
Used spec theorems:
int-gcd
/
divides-mod
int-gcd
/
divides
int-gcd
/
divides-prime
Used simplifier rules:
int-abs
/
sub-eq
int-mult
/
associativity
int-mult
/
commutativity
int-gcd
/
prime-two-01
int-basic2
/
add-c
int-basic2
/
add-a
int-gcd
/
prime-11