[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 2 from proof succ (
previous step
)
prime(m) ⊦ prime(m + 1) ↔ m = 2
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
prime(m), prime(m + 1) ⊦ m = 2
Rule argument
Additional information
Used simplifier rules: three: ⊦ prime(3);