[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 1 from proof twodiv-01 (conclusion)
⊦ prime(m + 1) → (2 | m ↔ m ≠ 1)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
prime(m + 1) ⊦ m = 1, 2 | m
Rule argument
Additional information
Used simplifier rules: divi-two: ⊦ ¬ 2 | 1;