[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 one-02 (conclusion)
⊦ m ≠ 0 → (¬ 1 < m ↔ m = 1)
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: one: ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1);