[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 7 from proof fle (
previous step
)
m < n, n ≤ n0, ¬ m < n0, ¬ m < n0 → ¬ n < n0 ⊦ n = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 8
:
m < n, n ≤ n0, n0 ≤ m, ¬ m < n0 → ¬ n < n0 ⊦ n = 0
Rule argument
Additional information
Used simplifier rules: lels: ⊦ ¬ m < n ↔ n ≤ m;