1. Improve naming
2. Make `wf_` proofs of `gmap` and `pmap` opaque
3. Avoid `bind` and `fmap` combinators for `SProp`
4. Drop `simpl` tests

Items 2-3 are crucial for performance, otherwise each operation checks if the map
is still well-formed, which destroys log(n) complexity of map operations.

Why 3 is needed is subtle: The `bind` and `fmap` lemmas for `SProp` contain Booleans
as implicit arguments, which are eagerly evaluated by `vm_compute`.

As a result of 2-3, `simpl` will not normalize proofs to `stt`, and `simpl` tests
do not give a desirable result.

Add `Proper`s for maps, and generalise existing ones. Add tests to check that the old ones can be derived.

- Define set-like notation `{[+ x1; ..; xn ]}` for multisets in terms of the new
  singleton class and disjoint union `⊎`.
- Remove `SemiSet` instance for multisets.
- Prove lemmas regarding `∈` and `∉` for multisets since we no longer get the
  generic versions for sets.
- Provide `SetUnfoldElemOf` instances for multisets since we no longer get the
  generic versions for sets.
- Prove lemmas new regarding `∈` and `∉` for `∩`

Fixes #100, #98 and #87.

This MR is an alternative to !232.

Turn `x ∈ X` only into `0 < multiplicity x X` at leaves of `∈` to enable better first-order reasoning.