[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-def
⊦ prime(j) ↔ 2 ≤ j ∧ (∀ i. 1 < i ∧ i < j → ¬ i | j)
Type: An axiom
Validity: The proof is valid.
Features: nokodkodax,
Comment:
Used by:
divides-prime
,
gcd-prime
,
max_prime_divisor-nls-zero
,
prime-def-mod
,
prime-def-prime
,
prime-mult-not
,
prime-not-neg
,
prime-not-neg-01
,
prime-one
,
prime-small
,
prime-two
,
prime-two-01
,
Used by units in proved state:
Proof exists?: No