Add comments.

theories/proofmode/reduction.v

@@ -20,6 +20,8 @@ Declare Reduction pm_eval := cbv [
 Ltac pm_eval t :=
   eval pm_eval in t.
 Ltac pm_reduce :=
+  (* Use [convert_concl_no_check] instead of [change] to avoid performing the
+  conversion check twice. *)
   match goal with |- ?u => let v := pm_eval u in convert_concl_no_check v end.
 Ltac pm_reflexivity := pm_reduce; exact eq_refl.
 
@@ -34,4 +36,6 @@ Declare Reduction pm_prettify := cbn [
   bi_tforall bi_texist
 ].
 Ltac pm_prettify :=
+  (* Use [convert_concl_no_check] instead of [change] to avoid performing the
+  conversion check twice. *)
   match goal with |- ?u => let v := eval pm_prettify in u in convert_concl_no_check v end.