[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 look-scan-range
⊦ len < # zbrar → (look(bv, key, adr, key-range(zbrar, scan(key, zbrar, 0, len), len + 1, ri)) ↔ look(bv, key, adr, ri))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 31
Used lemmas:
range
,
look
,
Used spec theorems:
znode-ops
/
scan-last
node-index-restrict
/
at-le
znode-ops
/
scan-lt-0
znode-ops
/
scan-le-0
Used simplifier rules:
nat
/
succ-01
nat-basic
/
eq-01
nat-basic
/
one-06
znode-ops
/
scan-base
node-index-restrict
/
at-le
oelem
/nat-set/
sls
nat
/
elim-pred-c
nat-basic
/
oz
nat-basic
/
z-01
nat
/
lep
nat-basic
/
succ
znode-ops
/
scan-rec
zbranch-array-sorted
/
le-key
nat-basic
/
eq-02
node-index-restrict
/
in-le
node-index-restrict
/
at-gt
nat
/
lez
znode-ops
/
scan-min-eq
node-index-restrict
/
in-gt
nat
/
lels
nat
/
eq
nat-basic
/
lf-02
znode-ops
/
scan-max-0
oelem
/nat-set/
irreflexivity
nat-basic
/
s-04
nat
/
ler
nat-basic
/
lf-01
nat-basic
/
c
nat-basic
/
a
nat
/
eqle-one
nat-basic
/
f