[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 bertrand-holds-lower
⊦ ∀ i. 0 < i ∧ i ≤ 2 ^ 10 → (∃ j. prime(j) ∧ i < j ∧ j ≤ 2 * i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
BertrandsPostulate
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 24
Used lemmas:
small-primes
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
forward-le
int-basic1
/
forward-pos
int-abs
/
numlsledel
int-basic1
/
numlslsdel
int-gcd
/
prime-three
int-abs
/
numlelsdel
int-div
/
nummult-le-02
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
lels-01
int-basic1
/
two-ls
int-mult
/
one-01
int-gcd
/
prime-le-2
int-gcd
/
prime-two-01