[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 124 from proof prepost-bubble-down (
previous step
)
⊦ valid-idx(kar, ar, n) ∧ m0 < n ∧ m1 < n ∧ kar[m0] = key-index(key1, n1) ∧ kar[m1] = key-index(key0, n0) → valid-idx(kar[m0, key-index(key0, n0)][m1, key-index(key1, n1)], ar[n0, ar[n0].idx:= m0][n1, ar[n0, ar0[n0].idx:= m0][n1].idx:= m1], n)
A spec-lemma