[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 f-01
⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
a-01
,
dups-eqsize-01
,
dups-eqsize-02
,
dups-firstoc-rew
,
dups-lesize
,
dups-sw
,
eq
,
eq-01
,
in-01-02
,
in-02-01
,
in-03-01
,
in-04-01
,
in-05-01
,
in-09
,
inapp
,
Used by units in proved state:
path-reachable
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 10
Used lemmas:
rec
,
d
,
Used spec theorems:
Used simplifier rules:
list
/
Nil
list
/
in-empty
list
/
in-01
list
/
in-rec
list
/
in-append
list
/
c
list
/
a