[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_prime_divisor-nle-zero-01
⊦ ¬ prime(i) ∧ 2 ≤ i → ¬ i / max_prime_divisor(i) ≤ 0
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: 1
Proof steps: 2
Used lemmas:
max_prime_divisor-nls-01
,
max_prime_divisor-nle-zero
,
max_prime_divisor-not-zero
,
Used spec theorems:
int-div
/
div-lezero
Used simplifier rules:
int-div
/
zero-07
int-abs
/
forward-lele
int-abs
/
forward-lels
int-abs
/
forward-le-04
int-abs
/
forward-le-01
int-abs
/
forward-le
int-div
/
div-zero-06
int-abs
/
lels