[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-in
⊦ j ∈ all_prime_divisors(i) → prime(j) ∧ j ≤ i
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
all_prime_divisors-ordered
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
all_prime_divisors-in-01
,
Used spec theorems:
Used simplifier rules:
int-gcd
/
div-not-ls
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
forward-lels
int-abs
/
lels-01