GitLab

Gregory Malecha authored May 29, 2020 and Robbert Krebbers committed May 29, 2020

- it doesn't seem to conflict with anything in Ltac

Here's one case this lemma might be useful. Suppose we want to
programmatically generate namespaces for e.g. locks:

```
Definition lockN (l : loc) := nroot .@ "lock" .@ l.
```

Then to know that two such namespaces are disjoint, we need to know
that the corresponding locations are distinct. For that we use
the lemma here introduced.

```
Lemma ne l1 l2 v1 v2 :
  l1 ↦ v1 -∗ l2 ↦ v2 -∗ ⌜l1 ≠ l2⌝.
Proof. iApply mapsto_mapsto_ne. (* goal ¬ ✓ 2%Qp *) by intros []. Qed.
```

Simon Friis Vindum authored Apr 23, 2020 and Ralf Jung committed Apr 23, 2020

Removes auth_both_op and renames auth_both_frac_op into auth_both_op.

- all ascii notation is marked "only parsing" so this PR shouldn't
  change anything for anyone using only unicode notation.
- the algorithm for creating an ascii notation is pretty simple.
  - \ast -> *
  - \triangleright -> |>
  - \vee -> \/
  - \wedge -> /\
  - \forall -> forall
  - \exists -> exists
  - \ast -> **