[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 88 from proof btree-clean-fwd-strong (
previous step
)
⊦ asar = asar0 ↔ # asar = # asar0 ∧ (∀ n. n < # asar → asar[n] = asar0[n])
A spec-lemma