[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 ri-range-ext (
previous step
)
nused ≤ # zbrar, sorted(zbrar, 0, nused), n = scan(key, zbrar, 0, nused) ⊦ n ≤ nused ∧ (n < nused → key ≤ zbrar[n].key) ∧ (∀ n0. n0 < n → zbrar[n0].key < key) ∧ (∀ n1. n < n1 ∧ n1 < nused → key < zbrar[n1].key)
A spec-lemma