[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 in-keyrange-in-ri (
previous step
)
⊦ n < nused ∧ nused ≤ # zbrar → key-range(zbrar, n, nused, ri) = (n = 0 ⊃ (nused = 1 ⊃ ri;ri |≤ zbrar[0].key);(n + 1 = nused ⊃ ri |> zbrar[n - 1].key;(ri |> zbrar[n - 1].key) |≤ zbrar[n].key))
Lemma
range