(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/nat/minimization".
-
include "nat/minus.ma".
let rec max i f \def
reflexivity.
qed.
+theorem f_min_true: \forall f:nat \to bool. \forall m:nat.
+(\exists i. le i m \land f i = true) \to
+f (min m f) = true.
+intros.unfold min.
+apply f_min_aux_true.
+elim H.clear H.elim H1.clear H1.
+apply (ex_intro ? ? a).
+split
+ [split
+ [apply le_O_n
+ |rewrite < plus_n_O.assumption
+ ]
+ |assumption
+ ]
+qed.
+
theorem lt_min_aux_to_false : \forall f:nat \to bool.
\forall n,off,m:nat. n \leq m \to m < (min_aux off n f) \to f m = false.
intros 3.