[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 4 from proof sorted-lt-post (
previous step
)
⊦ m0 < m ∧ m1 < m ∧ sorted(zbrar, n, m) → (zbrar[n + m0].key < zbrar[n + m1].key ↔ m0 < m1)
Lemma
sorted-lt-h