[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 dups-cons
⊦ dups(a ' + x) ↔ dups(x) ∨ a ∈ x
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
app-01-02
,
d
,
dups-eqsize-01
,
dups-eqsize-02
,
dups-firstoc-rew
,
dups-lesize
,
eq
,
eq-01
,
f-01
,
fin
,
in-06
,
inapp-01
,
l
,
rm-eq
,
rm-nodups
,
Used by units in proved state:
list-set
,
list-perm
,
list-del
,
path-reachable
,
path-reachable
,
list-last
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
rec
,
c-03
,
Used spec theorems:
Used simplifier rules:
list
/
a