[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 k-dups
⊦ dups(x) ↔ # x > 1 ∧ (x.head ∈ x.tail ∨ dups(x.tail))
Type: A user defined theorem
Validity: The proof is valid.
Features: kodkodax,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 5
Used lemmas:
rec
,
e-01
,
dups-rest
,
dups-in
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic
/
one
nat
/
gr-def
list-data
/
elim-list-c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
one-06
list
/
a
list
/
len-02
list
/
len
list
/
c
list
/
e-01
list
/
in-empty