[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 all_prime_divisors-rec-01
⊦ i | j ∧ prime(i) ∧ 0 < j → #oc(i, all_prime_divisors(j)) = #oc(i, all_prime_divisors(j / i)) + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-fac
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
all_prime_divisors-rec-02
,
Used spec theorems:
int-gcd
/
divides
Used simplifier rules:
int-abs
/
forward-le-05
int-div
/
div-mult-03
int-gcd
/
prime-not-neg-01
int-abs
/
lels
int-mult
/
zero-gr-03
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
lels-02
int-gcd
/
prime-not-neg