[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 bag-remadd-in
⊦ (bag -- n) ++ n = (n ∈ bag ⊃ bag;bag ++ n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
ubi-quality-base
,
sqns
,
ubi-base
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 7
Used lemmas:
Used spec theorems:
bag-union
/nat-bag/
in
Used simplifier rules:
bag-union
/nat-bag/
del-empty
bag-union
/nat-bag/
in-emp
bag-union
/nat-bag/
del-rec
bag-union
/nat-bag/
in-at
bag-basic
/nat-bag/
bag-add2-eq-elim
bag-union
/nat-bag/
bag-rm-add-eq
bag-union
/nat-bag/
in-add
bag-basic
/nat-bag/
insert-inj
bag-union
/nat-bag/
del-notin