[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 mklist-rmdup
⊦ ¬ a ∈ x ∧ n ≠ 0 → rmdup(x + mklist(a, n)) = rmdup(x) + a '
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 10
Used lemmas:
mk-elem
,
mklist-rmdup-01
,
Used spec theorems:
list-dup
/
rm-ifrec
Used simplifier rules:
list
/
Nil
list-dup
/
rmdup-e
list
/
c-04
list
/
in-06
list
/
in-append
list-dup
/
rmdup-y
list
/
app-08
list
/
a
list
/
c
list-dup
/
rmdup-n