[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 ordered-precedes-h (
previous step
)
⊦ ordered(n0 ' + n1 ' + ix, x) ↔ ordered(n1 ' + ix, x) ∧ n0 > n1 ∧ ¬ x[n1] < x[n0]
Lemma
ordered-rec2