[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-rec
⊦ prime(i) ∧ i | j ∧ 0 < j → max_exp(i, j) = max_exp(i, j / i) + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max_exp-div-not
,
max_exp-mult-01
,
max_exp-not-div
,
max_exp-zero-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
max_exp-def
,
Used spec theorems:
intlist
/
all_prime_divisors-rec-01
Used simplifier rules:
int-abs
/
forward-le-05
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
nat2int-05