GitLab

This better seals off their definition. Although it did not give
much of a speedup, I think it is conceptually nicer.

I am now also using reification to obtain the indexes corresponding to
the stuff we want to cancel instead of relying on matching using Ltac.

This reverts commit 7266d16b

due to an accidental git commit --amend after a git push.

In most cases there is a lot of duplicate proof search performed by
both naive_solver and eauto. Especially since naive_solver calls its
tactic (in the case of set_solver this used to be eauto) quite eagerly
this made it very slow.

Note that set_solver is this too slow and should be improved.

In most cases there is a lot of duplicate proof search performed by
both naive_solver and eauto. Especially since naive_solver calls its
tactic (in the case of set_solver this used to be eauto) quite eagerly
this made it very slow.

Note that set_solver is this too slow and should be improved.

This is all still pretty ad hoc, but oh well. Also, I have no idea why I had to make those instances in sta_dra global, but it complained about missing instances. Actually, I wonder how they could *not* be global previously...

This strengthens some lemmas that are written using the notion of closednes, shortening some proofs all the way up to barrier.v

this makes it slightlymore annoying to use because we have to elliminate the box. one more reason to have a proof mode ;-)

This fix removes superflous white space in pretty printing. For example
✓{S n} x was pretty printed incorrectly as ✓{(S n)} x.

turns out we can import with shorter names (and we actually already do that frequently in "From Coq Import")

This avoids ambiguity with P and Q that we were using before for both
uPreds/iProps and indexed uPreds/iProps.

- The direction of big_sepS_later and big_sepM_later is now like later_sep.
- Do not use generated variables in the proofs.

It is doing much more than just dealing with ∈, it solves all kinds
of goals involving set operations (including ≡ and ⊆).