[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 ri-range-ext
nused < # zbrar, sorted(zbrar, 0, nused) ⊦ ri0 = ri1 ↔ (∀ n. n ≤ nused → key-range(zbrar, n, nused + 1, ri0) = key-range(zbrar, n, nused + 1, ri1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
btree-clean-fwd
,
btree-clean-fwd-strong
,
btree-ri-unique
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 29
Used lemmas:
Used spec theorems:
store
/node-index/
k-Extension
znode-ops
/
scan-strong
store
/node-index/
Extension
zbranch-array-ops
/
at-range
zbranch-array-ops
/
range-first
zbranch-array-ops
/
range-inner
Used simplifier rules:
zbranch-array-ops
/
at-range
zbranch-array-ops
/
in-keyrange-in-ri
store
/node-index/
notmemlookup
nat
/
le-ls-simp
oelem
/nat-set/
ls-le
zbranch-array-ops
/
range-last
nat
/
ler
nat
/
anti
nat
/
elim-pred-c
nat-basic
/
s-04
nat-basic
/
oz
zbranch-array-sorted
/
le-key
znode-ops
/
scan-rec
nat-basic
/
z-01
nat
/
lep
oelem
/nat-set/
irreflexivity
nat
/
fle-01
zbranch-array-ops
/
range-first
znode-ops
/
scan-last
znode-ops
/
scan-base
nat-basic
/
zero
zbranch-array-sorted
/
sorted-base
zbranch-array-ops
/
range-one
nat-basic
/
zero-01
nat
/
lez-01
nat-basic
/
succ
nat-basic
/
lf
nat
/
lels-03
node-index-restrict
/
in-gt
node-index-restrict
/
in-le
nat-basic
/
l
nat
/
succ-01
nat
/
lez
nat-basic
/
lf-02
znode-ops
/
scan-min-eq
nat-basic
/
eqs
nat
/
lels
nat-basic
/
a
nat-basic
/
c
nat
/
eq
nat-basic
/
f