[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 mod-zero
⊦ m % n = 0 ∧ n < m ∧ 2 ≤ n → (prime(m) ↔ m = 2)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
mult
,
two
,
Used spec theorems:
nat-div
/
modex
Used simplifier rules:
nat
/
fle-01
nat
/
not-zero
nat-basic1
/
f
nat-basic1
/
one
nat-mult
/
ls-04
nat-mult
/
zero-06
nat-mult
/
two-03
nat-mult
/
mult-a
nat-mult
/
mult-c