[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 small-primes
⊦ prime(2) ∧ prime(3) ∧ prime(5) ∧ prime(7) ∧ prime(13) ∧ prime(23) ∧ prime(43) ∧ prime(83) ∧ prime(163) ∧ prime(317) ∧ prime(631) ∧ prime(1259)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bertrand-holds-lower
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
Used spec theorems:
int-gcd
/
prime-1259
int-gcd
/
prime-631
int-gcd
/
prime-317
int-gcd
/
prime-163
int-gcd
/
prime-83
int-gcd
/
prime-43
int-gcd
/
prime-23
int-gcd
/
prime-13
int-gcd
/
prime-7
int-gcd
/
prime-5
Used simplifier rules:
int-gcd
/
prime-three
int-gcd
/
prime-two-01