[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
,
Proof step 6 from proof prime-prime (
previous step
)
n ≠ 0 ∧ n ≠ 1 ∧ (∀ m. 2 ≤ m ∧ prime(m) ∧ m * m ≤ n → n % m ≠ 0) ⊦ prime(n)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
∀ m. 2 ≤ m ∧ prime(m) ∧ m * m ≤ n → n % m ≠ 0 ⊦ n = 1, n = 0, prime(n)
Rule argument
Additional information