Fixed issue finding lemma

Author: lstrsrmn

classical/functions.v

@@ -2680,12 +2680,12 @@ Proof. by apply/funext => x/=; rewrite mulrC. Qed.
 Lemma min_fun_to_max (T : Type) (T' : numDomainType) (f g : T -> T') :
   (f \min g) = (f + g) - (f \max g).
 Proof.
-apply/funext=> x /=; by rewrite minr_to_max. Qed.
+apply/funext=> x /=; by rewrite Num.Theory.minr_to_max. Qed.
 
 Lemma max_fun_to_min (T : Type) (T' : numDomainType) (f g : T -> T') :
   (f \max g) = (f + g) - (f \min g).
 Proof.
-apply/funext => x /=; by rewrite maxr_to_min. Qed.
+apply/funext => x /=; by rewrite Num.Theory.maxr_to_min. Qed.
 
 Lemma fun_maxC d (T : Type) (T' : orderType d) (f g : T -> T') :
   f \max g = g \max f.