When tuple literals are compared, it would be good to reduce them to the conjunction of the comparison of their fields, analogously to what happens with comparison of tuple literals.
E.g.,
type t = { x: int; y: int }.
lemma L x y :
x = 0 => y = 1 => {| x = x; y = y |} = {| x = 0; y = 1 |}.
proof. move=> xE yE /=; split; assumption. qed.
When tuple literals are compared, it would be good to reduce them to the conjunction of the comparison of their fields, analogously to what happens with comparison of tuple literals.
E.g.,