This prevent the assumption from being dragged into lemmas that do not even need it

The singleton maps notation is now also more consistent with the
insert <[_ := _]> _ notation for maps.

We now have:

  Π★{map Q } ...
  Π★{set Q } ...

to differentiate between sets and maps.

* Clearly separate the file algebra/sts in three parts:
  1.) The definition of an STS, step relations, and closure stuff
  2.) The construction as a disjoint RA (this module should never be used)
  3.) The construction as a CMRA with many derived properties
* Turn stsT into a canonical structure so that we can make more of its arguments
  implicit.
* Rename the underlying step relation of STSs to prim_step (similar naming as
  for languages, but here in a module to avoid ambiguity)
* Refactor program_logic/sts by moving general properties of the STS CMRA to
  algebra/sts.v
* Make naming and use of modules in program_logic/sts more consistent with
  program_logic/auth and program_logic/saved_prop
* Prove setoid properties of all definitions in program_logic/sts

With nicely overloaded notations for sets and maps.

Turns out it only holds as a view shift, not as an implication

I thought I could derive an interesting Lemma from this. Turns out I cannot. But this one may still be useful, at some point.

On branch master
	modified:   algebra/fin_maps.v
Untracked files:
	heap_lang/heap.v
no changes added to commit (use "git add" and/or "git commit -a")

(missed practically everything in the previous commit)