[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-nls-03
⊦ prime(i / max_prime_divisor(i)) ∧ ¬ prime(i) ∧ 2 ≤ i → ¬ max_prime_divisor(i) < i / max_prime_divisor(i)
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: 4
Proof steps: 8
Used lemmas:
prime-one
,
div-mult
,
divides
,
max_prime_divisor-def
,
prime-ex-max
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-div
/
div-mult-03
int-mult
/
zero-left
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
lels
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-abs
/
forward-lele
int-mult
/
le-same
int-mult
/
zero-gr
int-mult
/
zero-ge
int-abs
/
zero-gels-04
int-mult
/
ls-same-01