[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 61 from proof prepost-bubble-up (
previous step
)
⊦ no-dups-idx(kar, n) ∧ kar[m0] = ki0 ∧ kar[m1] = ki1 ∧ m0 < n ∧ m1 < n ∧ m0 < # kar ∧ m1 < # kar → no-dups-idx(kar[m0, ki1][m1, ki0], n)
A spec-lemma