[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 mod2 (conclusion)
⊦ m % 2 = 0 → (prime(m) ↔ m = 2)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
m % 2 = 0, prime(m) ⊦ m = 2
Rule argument
Additional information
Used simplifier rules: two: ⊦ prime(2);