In particular, it no longer uses set_solver (which made it often slow
or diverge) but a more specific lemma about subseteq.

Concretely, when execution of any of the wp_ tactics does not yield
another wp, it will make sure that a view shift is kept. This
behavior was already partially there, but now it is hopefully more
consistent.

This is more consistent with the proofmode, where we also call it pure.

Fixes issue #20.

This introduces n hypotheses and destructs the nth one.

We used => before, which is strange, because it has another meaning
in ssreflect.

And use slice_name, which is defined as gname but Opaque, instead
of gname in boxes.

They mess up the proof mode notations due to overlaps.

be the same as .

This is a fairly intrusive change, but at least makes notations more
consistent, and often shorter because fewer parentheses are needed. Note
that viewshifts already had the same precedence as →.

Now, for example, when having equiv (Some x) (Some y) it will
try to find a Proper whose range is an equiv before hitting the
eq instance. My hack is general enough that it works for Forall2,
dist, and so on, too.

It used to be: (P ={E}=> Q) := (True ⊢ (P → |={E}=> Q))
Now it is: (P ={E}=> Q) := (P ⊢ |={E}=> Q)