[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 53 from proof btree-clean-fwd-strong (
previous step
)
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))
Lemma
ri-range-ext