[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 prime-ex-max
⊦ ¬ prime(i) ∧ 2 ≤ i → (∃ j. prime(j) ∧ j | i ∧ j < i ∧ (∀ j0. j < j0 ∧ j0 < i ∧ prime(j0) → ¬ j0 | i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max_prime_divisor-divides
,
max_prime_divisor-nle
,
max_prime_divisor-nle-01
,
max_prime_divisor-nle-zero
,
max_prime_divisor-nls
,
max_prime_divisor-nls-02
,
max_prime_divisor-nls-03
,
max_prime_divisor-prime
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 14
Used lemmas:
prime-def-prime
,
Used spec theorems:
Used simplifier rules:
int-abs
/
numlsledel-01
int-abs
/
lels
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
forward-lele
int-mult
/
le-same
int-abs
/
bet
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
one-01
int-abs
/
anti
int-basic1
/
lf-02
int-basic2
/
succ-01
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
zero-gels-04
intnat
/
labs
int-abs
/
abssub-02
int-abs
/
sub-ls
int-abs
/
sub-add-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-ls-01
int-basic2
/
ls-add-both