[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 valid-indices-nodups-h
⊦ n ≤ # ar → ¬ dups(ar.indicesWhere(φ, n))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
map-ifn-at
,
valid-indices-nodups
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 13
Used lemmas:
valid-indices-indiceswhere-h-strong
,
indiceswhere-rec
,
indiceswhere-base
,
Used spec theorems:
list-dup
/nat-list-set/
dups-appex
Used simplifier rules:
nat
/
lez
list-dup
/nat-list-set/
e-01
nat-basic
/
f
list
/nat-list-set/
c
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
list
/nat-list-set/
in-17
list-dup
/nat-list-set/
c
nat
/
lels-03
nat-basic
/
ref
list
/nat-list-set/
a
list
/nat-list-set/
app