[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-rec
⊦ prime(i) ∧ 0 < j ∧ 0 ≤ j0 ∧ j0 < i → max_exp(i, fac(i * j + j0)) = j + max_exp(i, fac(j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max_exp-fac-gen
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 21
Used lemmas:
prime-fac-divides-not
,
max_exp-zero-02
,
max_exp-one
,
fac-zero
,
max_exp-same
,
fac-pos-01
,
max_exp-mult
,
fac-rec
,
max_exp-fac-add
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int-mult
/
zero-gr
intnat
/
abs-pred
int-abs
/
lels-03
int-abs
/
numadd-01
int-abs
/
forward-le-05
int-basic2
/
add-zero
int-mult
/
Mult-zero
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
sub-ls
int-abs
/
succ-02
int-abs
/
ler
int-abs
/
sub-ls-01
int-abs
/
lels
int-abs
/
bet
int-abs
/
sub-eq-01
int-gcd
/
div-one-pos
int-abs
/
bet-01
int-gcd
/
prime-one
int-abs
/
Sub-def
int-abs
/
sub-eq
int-abs
/
sub-add-01
int-basic2
/
add-in
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
eq-dist
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
elim-sub