apply bool_ind (\lambda b:bool.
(f (S n1) = b) \to (f ([\lambda b:bool.nat] match b in bool with
[ true \Rightarrow (S n1)
-| false \Rightarrow (max n1 f)])) = true) ? ? ?.
+| false \Rightarrow (max n1 f)])) = true).
simplify.intro.assumption.
simplify.intro.apply H.
elim H1.elim H3.generalize in match H5.
intros.
apply ex_intro nat ? a.
split.apply le_S_S_to_le.assumption.assumption.
-intros.apply False_ind.apply not_eq_true_false ?.
+intros.apply False_ind.apply not_eq_true_false.
rewrite < H2.rewrite < H7.rewrite > H6. reflexivity.
reflexivity.
qed.
apply bool_ind (\lambda b:bool.
(f (m-(S n)) = b) \to (f ([\lambda b:bool.nat] match b in bool with
[ true \Rightarrow m-(S n)
-| false \Rightarrow (min_aux n m f)])) = true) ? ? ?.
+| false \Rightarrow (min_aux n m f)])) = true).
simplify.intro.assumption.
simplify.intro.apply H.
elim H1.elim H3.elim H4.
elim min_aux_S f n1 n.
elim H1.rewrite > H3.apply le_n.
elim H1.rewrite > H3.
-apply trans_le (n-(S n1)) (n-n1) ?.
+apply trans_le (n-(S n1)) (n-n1).
apply monotonic_le_minus_r.
apply le_n_Sn.
assumption.