[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 oc-dups
⊦ n < #oc(a, x) ∧ ¬ dups(x) → #oc(a, x) = 1
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
nodups
,
size-perm
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
one-01
,
notin
,
one
,
ocappend
,
oc-e
,
oc-zero
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
zero-01
nat-basic1
/
f
list-dup
/
rec
list
/
in-rec
nat-basic2
/
one
list
/
a
list
/
c
nat-basic1
/
one-01
nat-basic2
/
add-base
nat
/
lels
nat
/
fle-01
nat-basic2
/
l-01
list
/
in-17
nat-basic2
/
a
nat-basic2
/
c