[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 1 from proof nodups-oc-2 (
previous step
)
⊦ m < # A ∧ nodups(A) → (∀ n. (n < m → #oc(A[n], A, m) = 1) ∧ (m ≤ n ∧ n < # A → #oc(A[n], A, m) = 0))
Lemma
nodups-oc