[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 unique-elems-add
⊦ unique-elems(bag ++ m) ↔ unique-elems(bag) ∧ ¬ m ∈ bag
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
unique-elems-addmax
,
unique-elems-addtwice
,
Used by units in proved state:
ubi-base
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 16
Used lemmas:
unique-elems
,
Used spec theorems:
bag-union
/nat-bag/
in
bag-basic
/nat-bag/
count-insert
Used simplifier rules:
nat-basic
/
one
nat
/
le-def
bag-basic
/nat-bag/
count-same
nat
/
one-01
nat-basic
/
add-base
nat-basic
/
c
nat-basic
/
a
nat-basic
/
one-03
nat
/
one-02