Adapt to rocq-prover/rocq#20810.

Author: ppedrot

theories/core/PrimStringAxioms.v.in

@@ -18,7 +18,7 @@
 #[skip="8.20"]   move: E; rewrite compare_spec.
 #[skip="8.20"]   elim: (to_list s1) (to_list s2) => [[]//|x xs IH [|y ys] //=].
 #[skip="8.20"]   rewrite Uint63Axioms.compare_def_spec /compare_def.
-#[skip="8.20"]   move: (eqb_correct x y); case: eqb => [/(_ isT)->|_].
+#[skip="8.20"]   move: (eqb_correct x y); case: PrimInt63.eqb => [/(_ isT)->|_].
 #[skip="8.20"]     suff: ltb y y = false by move=> -> /IH ->.
 #[skip="8.20"]     have [+ _] := ltb_spec y y.
 #[skip="8.20"]     by case: ltb => // /(_ isT); case: (to_Z y) => //=; elim.