diff --git a/theories/namespaces.v b/theories/namespaces.v
index c135f3bb546bd8180dc0b040a4ebf15553e533d5..2d5038c00c7cf9e0d2a8614b9fdc1c2c29c9d78b 100644
--- a/theories/namespaces.v
+++ b/theories/namespaces.v
@@ -58,7 +58,7 @@ Section namespace.
     intros Hxy a. unfold up_close. rewrite !nclose_eq, !ndot_eq.
     unfold nclose_def, ndot_def; rewrite !elem_coPset_suffixes.
     intros [qx ->] [qy Hqy].
-    revert Hqy. by intros [= ?%encode_inj]%positives_flatten_suffix_eq.
+    revert Hqy. by intros [= ?%(inj _)]%positives_flatten_suffix_eq.
   Qed.
 
   Lemma ndot_preserve_disjoint_l N E x : ↑N ## E → ↑N.@x ## E.
diff --git a/theories/option.v b/theories/option.v
index 9ba258be2e04909b3b8a26f09a8c096b814491bc..f658505e880018ead0a31fe45f06996ea5a8d751 100644
--- a/theories/option.v
+++ b/theories/option.v
@@ -189,8 +189,8 @@ Lemma fmap_Some_equiv {A B} `{Equiv B} `{!Equivalence (≡@{B})} (f : A → B) m
   f <$> mx ≡ Some y ↔ ∃ x, mx = Some x ∧ y ≡ f x.
 Proof.
   destruct mx; simpl; split.
-  - intros ?%Some_equiv_inj. eauto.
-  - intros (? & ->%Some_inj & ?). constructor. done.
+  - intros ?%(inj _). eauto.
+  - intros (? & ->%(inj _) & ?). constructor. done.
   - intros ?%symmetry%equiv_None. done.
   - intros (? & ? & ?). done.
 Qed.