a=?b =false-> b=?a =false. To prove this which command i should apply?

You may search into Coq's library the lemma about commutativity of Boolean comparison.

```
Search ((?x =? ?y) = (?y =? ?x)).
Goal forall a b, a=?b = false -> b=?a = false.
intros a b; rewrite Nat.eqb_sym; easy.
Qed.
```

I thought `lia`

meanwhile does support boolean relational operators, but apparently it doesn't.

Last updated: Jun 16 2024 at 03:41 UTC