UsingEq.agda:13,35-39
I'm not sure if there should be a case for the constructor refl,
because I get stuck when trying to solve the following unification
problems (inferred index ≟ expected index):
  p + q ≟ q + p
when checking that the pattern refl has type p + q ≡ q + p
