I've been unable to find the following lemma:

```
Lemma leq_eq_addn: forall m n, m <= n <-> exists p, n = m + p.
Proof.
split ; last first.
move=> [p Hp].
rewrite Hp.
apply: leq_addr.
move=> H.
exists (n - m).
rewrite subnKC //=.
Qed.
```

I have to admit my searching skills aren't very good... was it somewhere and I missed it?

look for n = m + (n - m) or similar

Well, I did find subnKC -- which I used to prove the lemma, but that's not what I was looking for

Last updated: Feb 08 2023 at 07:02 UTC