[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
,
Theorem nodups-oc
⊦ m < # A ∧ nodups(A) → (∀ n. (n < m → #oc(A[n], A, m) = 1) ∧ (m ≤ n ∧ n < # A → #oc(A[n], A, m) = 0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
nodups-oc-2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 16
Used lemmas:
nodups-def
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
zero
nat-basic1
/
zero-01
nat
/
lez
array-perm
/array_of_nat/
numoc-base
nat
/
succ-01
array-perm
/array_of_nat/
numoc-rec
nat-basic2
/
s
nat-basic2
/
nls-fst
nat-basic2
/
ax-08
nat
/
fle-01
nat-basic2
/
z-01
nat
/
le-ls-simp
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat-basic1
/
ls-02
nat
/
lels-03
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
f
nat-basic1
/
lf
nat
/
lels-02
nat
/
anti
nat
/
lels
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
one