[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
⊦ prime(n) ↔ 1 < n ∧ (∀ m. m | n → m = 1 ∨ m = n)
Type: An axiom
Validity: The proof is valid.
Features: nokodkodax,
Comment:
Used by:
div
,
leone
,
lstwo
,
modprime
,
mult
,
mult-01
,
mult-02
,
not-prime
,
rax
,
three
,
two
,
twodiv-02
,
Used by units in proved state:
Proof exists?: No