proposition: Lemma min_picks_first: forall num mono start, start <= mono -> fold_right Z.min start (repeat mono num) = start.
proof: Proof. intros. induction num; trivial. simpl. rewrite IHnum. rewrite Z.min_r; lia. Qed.
imports: VST.floyd.proofauto Coq.Classes.Equivalence CertiGraph.lib.List_ext