[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
,
Theorem scan-entry
⊦ zbrar[m + n] = mkzentry(key, adr) ∧ sorted(zbrar, m, nused) ∧ n < len ∧ len ≤ nused ∧ m + nused ≤ # zbrar → scan(key, zbrar, m, len) = m + n
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
scan-entry-0
,
scan-given
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
scan-rec
,
scan-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
eq-02
nat
/
lez
zbranch-array-sorted
/
sorted-entry-lt-post
zbranch-array-sorted
/
le-key
nat-basic
/
trans
nat-basic
/
lf
nat-basic
/
oz
nat-basic
/
add-base
zbranch-array-sorted
/
sorted-base
nat-basic
/
zero-01
nat
/
fle
nat-basic
/
f
nat
/
lels
nat-basic
/
ls-02
nat-basic
/
l
nat-basic
/
s-04
nat-basic
/
succ
nat-basic
/
a
nat-basic
/
c
zbranch-array-sorted
/
sorted-rec1
nat
/
succ-01