[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 scan-entry-0 (
previous step
)
⊦ zbrar[m + n] = mkzentry(key, adr) ∧ sorted(zbrar, m, nused) ∧ n < len ∧ len ≤ nused ∧ m + nused ≤ # zbrar → scan(key, zbrar, m, len) = m + n
Lemma
scan-entry