[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-fac-add
⊦ prime(i) ∧ 0 < j ∧ 0 ≤ j0 ∧ j0 < i → max_exp(i, fac(i * j + j0)) = max_exp(i, fac(i * j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max_exp-fac-rec
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 12
Used lemmas:
max_exp-zero-02
,
fac-pos-01
,
max_exp-mult
,
fac-add
,
Used spec theorems:
intlist
/
product-positive
intlist
/
product-prime-divides
intlist
/
countFun-in
Used simplifier rules:
int-abs
/
lels-01
int-abs
/
forward-le-01
int-mult
/
zero-ge
int-abs
/
zero-gels-04
int-abs
/
lels
int-abs
/
forward-lele
int-abs
/
forward-le-04
int-basic2
/
ls
int-mult
/
zero-ls
int-basic1
/
ls-01
int-basic2
/
eq
int-gcd
/
divides-mult-add
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
leone
int-abs
/
forward-lsle
int-abs
/
forward-le-05
int-abs
/
forward-lels
int-gcd
/
div-not-ls