A more intuitive proof that lists from a COFE

See merge request iris/iris!239

Add synopsis so make build-dep does not complain

See merge request iris/iris!238

Paolo G. Giarrusso authored 5 years ago and Ralf Jung committed 5 years ago

Nitpick, yes, but I've seen the complaint enough times today to bother.

That complaint is only useful to maintainers, and it's even in color.

```
[WARNING] Failed checks on coq-iris-builddep package definition from source at file:///Users/pgiarrusso/git/Coq/0IRIS-SWITCH/iris/build-dep:
    error 57: Synopsis and description must not be both empty
```

This proof also more easily scales to other recursive types, like
trees etc.

Notably, `big_andL_andL` and `big_andL_and` where a ⊣⊢ and ⊢ version
of the same lemma. I favored the `big_opL_op` naming scheme.

Allow multiple arguments in `iEval .. in` and `iSimpl in`.

Closes #238

See merge request iris/iris!237

Fix documentation for ofe_funR

See merge request iris/iris!236

This comment wasn't updated after
866cad62.

Avoid conversion after only reducing goal.

See merge request iris/iris!235

If Ralf didn't know it, I guess it deserves a name. This is the first I got,
feel free to improve.

That's the documentation I'd have wanted to see, and viceversa the lack of this
rule implied (to me) that this wouldn't work.