[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 28 from proof ordered-precedes-h (conclusion)
⊦ ordered(ix0 + n0 ' + ix1 + n1 ' + ix2, x) → n1 < n0 ∧ ¬ x[n1] < x[n0]
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 27
:
ordered(ix0 + n0 ' + ix1 + n1 ' + ix2, x) ⊦ n1 < n0 ∧ ¬ x[n1] < x[n0]
Rule argument
Additional information
[Concretesimprules(())]