[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-01
⊦ prime(i) ∧ 0 ≤ j0 ∧ j0 < i → max_exp(i, fac(i + j0)) = 1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
max_exp-zero
,
fac-pos-01
,
max_exp-mult
,
fac-rec
,
max_exp-fac-same
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-basic2
/
zero-02
int-basic2
/
add-zero
int-abs
/
sub-add-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-ls
int-abs
/
succ-02
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
lels-01
int-basic1
/
ls-01
intnat
/
abs-pred
int-abs
/
lels
int-abs
/
lels-02