[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-not-div
⊦ ¬ i | j ∧ prime(i) ∧ 0 < j0 ∧ 0 < j → max_exp(i, j * j0) = max_exp(i, j0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max_exp-mult-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 16
Used lemmas:
max_exp-zero-01
,
max_exp-pos-04
,
max_exp-rec
,
Used spec theorems:
int-div
/
div-lezero
int-gcd
/
divides
Used simplifier rules:
int-abs
/
forward-le-05
int-gcd
/
divides-mult-01
int-basic2
/
add-in
intnat
/
labs
int-abs
/
abs-le-succ
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-div
/
div-zero-06
int-gcd
/
div-not-ls
int-abs
/
lels
int-mult
/
Mult-zero
int-div
/
div-mult-03
int-gcd
/
prime-not-neg-01
int-gcd
/
prime-divides
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
zero-gr