diff --git a/tests/proofmode.v b/tests/proofmode.v
index d2ba302b5af08a316d72bbea00f762b3aef977cf..f558964abcad9ac27c4594941a9caadef7f1b67d 100644
--- a/tests/proofmode.v
+++ b/tests/proofmode.v
@@ -490,7 +490,7 @@ Lemma test_big_sepL_simpl x (l : list nat) P :
   ([∗ list] k↦y ∈ l, <affine> ⌜ y = y ⌝) -∗
   ([∗ list] y ∈ x :: l, <affine> ⌜ y = y ⌝) -∗
   P.
-Proof. iIntros "HP ?? /=". Show. done. Qed.
+Proof. iIntros "HP ??". Show. done. Qed.
 
 Lemma test_big_sepL2_simpl x1 x2 (l1 l2 : list nat) P :
   P -∗
diff --git a/theories/proofmode/reduction.v b/theories/proofmode/reduction.v
index 0d05f379479bf9794a44a9e1d13f6b9ccbc0da10..3dd260e5ad55ef731276d936978cb288c7469924 100644
--- a/theories/proofmode/reduction.v
+++ b/theories/proofmode/reduction.v
@@ -22,7 +22,8 @@ Declare Reduction pm_cbn := cbn [
   tele_fold tele_bind tele_app
   (* BI connectives *)
   bi_persistently_if bi_affinely_if bi_intuitionistically_if
-  bi_wandM bi_tforall bi_texist
+  bi_wandM big_opL
+  bi_tforall bi_texist
 ].
 Ltac pm_eval t :=
   let u := eval pm_cbv in t in